Preben D. Vestergaard

According to our database1, Preben D. Vestergaard authored at least 33 papers between 1988 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees.
Ars Comb., 2013

2010
All P<sub>3</sub>-equipackable graphs.
Discret. Math., 2010

A note on equimatchable graphs.
Australas. J Comb., 2010

2009
Total Domination in Partitioned Graphs.
Graphs Comb., 2009

An upper bound on the domination number of a graph with minimum degree 2.
Discret. Math., 2009

2008
Total domination in partitioned trees and partitioned graphs with minimum degree two.
J. Glob. Optim., 2008

A short update on equipackable graphs.
Discret. Math., 2008

2007
Domination in partitioned graphs with minimum degree two.
Discret. Math., 2007

An Upper Bound on the Number of Independent Sets in a Tree.
Ars Comb., 2007

2006
Largest Non-Unique Subgraphs.
Graphs Comb., 2006

Generalized connected domination in graphs.
Discret. Math. Theor. Comput. Sci., 2006

Well-covered graphs and factors.
Discret. Appl. Math., 2006

2005
Connected Factors in Graphs - a Survey.
Graphs Comb., 2005

The number of independent sets in unicyclic graphs.
Discret. Appl. Math., 2005

Dominating sets with at most k components.
Ars Comb., 2005

2004
Even [a, b]-factors in graphs.
Discuss. Math. Graph Theory, 2004

2003
On even [2, b]-factors in graphs.
Australas. J Comb., 2003

2002
Domination in partitioned graphs.
Discuss. Math. Graph Theory, 2002

On well-covered graphs of odd girth 7 or greater.
Discuss. Math. Graph Theory, 2002

2000
<i>alpha<sub>k</sub></i>- and <i>gamma<sub>k</sub></i>-stable graphs.
Discret. Math., 2000

1998
Interpolation theorems for domination numbers of a graph.
Discret. Math., 1998

Interpolation theorems for the (r, s)-domination number of spanning trees.
Australas. J Comb., 1998

1997
Totally equimatchable graphs.
Discret. Math., 1997

1996
Well covered simplicial, chordal, and circular arc graphs.
J. Graph Theory, 1996

On numbers of vertices of maximum degree in the spanning trees of a graph.
Discret. Math., 1996

Graphs with all spanning trees nonisomorphic.
Discret. Math., 1996

1995
Well Irredundant Graphs.
Discret. Appl. Math., 1995

1994
Two-cacti with minimum number of spanning trees.
Discret. Math., 1994

1993
Odd factors of a graph.
Graphs Comb., 1993

1992
Edge orbits and edge-deleted subgraphs.
Graphs Comb., 1992

Spanning trees in a cactus.
Discret. Math., 1992

1991
Graphs with two isomorphism classes of spanning unicyclic subgraphs.
Graphs Comb., 1991

1988
Graphs with one isomorphism class of spanning unicyclic graphs.
Discret. Math., 1988


  Loading...