Preben D. Vestergaard

Publication Activity (10 Years)

Years Active: 1988-2013
Publications (10 Years): 0

Top Topics

Top Venues

Publications

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