Preben D. Vestergaard

32 papers Journal 32
YearRankTypeTitle / Venue / Authors
2013 J jnl
Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees.
Ars Comb.
Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko, Preben D. Vestergaard
2010 J jnl
A note on equimatchable graphs.
Australas. J Comb.
Allan Frendrup, Bert L. Hartnell, Preben D. Vestergaard
2010 J jnl
All P
Discret. Math.
Bert Randerath, Preben D. Vestergaard
2009 J jnl
An upper bound on the domination number of a graph with minimum degree 2.
Discret. Math.
Allan Frendrup, Michael A. Henning, Bert Randerath, Preben D. Vestergaard
2009 J jnl
Total Domination in Partitioned Graphs.
Graphs Comb.
Allan Frendrup, Preben D. Vestergaard, Anders Yeo
2008 J jnl
A short update on equipackable graphs.
Discret. Math.
Preben D. Vestergaard
2008 J jnl
Total domination in partitioned trees and partitioned graphs with minimum degree two.
J. Glob. Optim.
Allan Frendrup, Michael A. Henning, Preben D. Vestergaard
2007 J jnl
An Upper Bound on the Number of Independent Sets in a Tree.
Ars Comb.
Anders Sune Pedersen, Preben D. Vestergaard
2007 J jnl
Domination in partitioned graphs with minimum degree two.
Discret. Math.
Michael A. Henning, Preben D. Vestergaard
2006 J jnl
Generalized connected domination in graphs.
Discret. Math. Theor. Comput. Sci.
Mekkia Kouider, Preben D. Vestergaard
2006 J jnl
Largest Non-Unique Subgraphs.
Graphs Comb.
Lars Døvling Andersen, Preben D. Vestergaard, Zsolt Tuza
2006 J jnl
Well-covered graphs and factors.
Discret. Appl. Math.
Bert Randerath, Preben D. Vestergaard
2005 J jnl
Connected Factors in Graphs - a Survey.
Graphs Comb.
Mekkia Kouider, Preben D. Vestergaard
2005 J jnl
Dominating sets with at most k components.
Ars Comb.
Bert L. Hartnell, Preben D. Vestergaard
2005 J jnl
The number of independent sets in unicyclic graphs.
Discret. Appl. Math.
Anders Sune Pedersen, Preben D. Vestergaard
2004 J jnl
Even [a, b]-factors in graphs.
Discuss. Math. Graph Theory
Mekkia Kouider, Preben D. Vestergaard
2003 J jnl
On even [2, b]-factors in graphs.
Australas. J Comb.
Mekkia Kouider, Preben D. Vestergaard
2002 J jnl
Domination in partitioned graphs.
Discuss. Math. Graph Theory
Zsolt Tuza, Preben D. Vestergaard
2002 J jnl
On well-covered graphs of odd girth 7 or greater.
Discuss. Math. Graph Theory
Bert Randerath, Preben D. Vestergaard
1998 J jnl
Interpolation theorems for domination numbers of a graph.
Discret. Math.
Jerzy Topp, Preben D. Vestergaard
1998 J jnl
Interpolation theorems for the (r, s)-domination number of spanning trees.
Australas. J Comb.
Jerzy Topp, Preben D. Vestergaard
1997 J jnl
Totally equimatchable graphs.
Discret. Math.
Jerzy Topp, Preben D. Vestergaard
1996 J jnl
Graphs with all spanning trees nonisomorphic.
Discret. Math.
Lars Døvling Andersen, Preben D. Vestergaard
1996 J jnl
On numbers of vertices of maximum degree in the spanning trees of a graph.
Discret. Math.
Jerzy Topp, Preben D. Vestergaard
1996 J jnl
Well covered simplicial, chordal, and circular arc graphs.
J. Graph Theory
Erich Prisner, Jerzy Topp, Preben D. Vestergaard
1995 J jnl
Well Irredundant Graphs.
Discret. Appl. Math.
Jerzy Topp, Preben D. Vestergaard
1994 J jnl
Two-cacti with minimum number of spanning trees.
Discret. Math.
Preben D. Vestergaard
1993 J jnl
Odd factors of a graph.
Graphs Comb.
Jerzy Topp, Preben D. Vestergaard
1992 J jnl
Edge orbits and edge-deleted subgraphs.
Graphs Comb.
Lars Døvling Andersen, Songkang Ding, Gert Sabidussi, Preben D. Vestergaard
1992 J jnl
Spanning trees in a cactus.
Discret. Math.
Yoshimi Egawa, Preben D. Vestergaard
1991 J jnl
Graphs with two isomorphism classes of spanning unicyclic subgraphs.
Graphs Comb.
Preben D. Vestergaard
1988 J jnl
Graphs with one isomorphism class of spanning unicyclic graphs.
Discret. Math.
Preben D. Vestergaard