Graphs with one isomorphism class of spanning unicyclic graphs. - Preben D. Vestergaard (Discret. Math., 1988)

Graphs with two isomorphism classes of spanning unicyclic subgraphs. - Preben D. Vestergaard (Graphs Comb., 1991)

Spanning trees in a cactus. - Yoshimi Egawa; Preben D. Vestergaard (Discret. Math., 1992)

Edge orbits and edge-deleted subgraphs. - Lars Døvling Andersen; Songkang Ding; Gert Sabidussi; Preben D. Vestergaard (Graphs Comb., 1992)

Odd factors of a graph. - Jerzy Topp; Preben D. Vestergaard (Graphs Comb., 1993)

Two-cacti with minimum number of spanning trees. - Preben D. Vestergaard (Discret. Math., 1994)

Well Irredundant Graphs. - Jerzy Topp; Preben D. Vestergaard (Discret. Appl. Math., 1995)

Graphs with all spanning trees nonisomorphic. - Lars Døvling Andersen; Preben D. Vestergaard (Discret. Math., 1996)

On numbers of vertices of maximum degree in the spanning trees of a graph. - Jerzy Topp; Preben D. Vestergaard (Discret. Math., 1996)

Well covered simplicial, chordal, and circular arc graphs. - Erich Prisner; Jerzy Topp; Preben D. Vestergaard (J. Graph Theory, 1996)

Totally equimatchable graphs. - Jerzy Topp; Preben D. Vestergaard (Discret. Math., 1997)

Interpolation theorems for the (r, s)-domination number of spanning trees. - Jerzy Topp; Preben D. Vestergaard (Australas. J Comb., 1998)

Interpolation theorems for domination numbers of a graph. - Jerzy Topp; Preben D. Vestergaard (Discret. Math., 1998)

alphak- and gammak-stable graphs. - Jerzy Topp; Preben D. Vestergaard (Discret. Math., 2000)

On well-covered graphs of odd girth 7 or greater. - Bert Randerath; Preben D. Vestergaard (Discuss. Math. Graph Theory, 2002)

Domination in partitioned graphs. - Zsolt Tuza; Preben D. Vestergaard (Discuss. Math. Graph Theory, 2002)

On even [2, b]-factors in graphs. - Mekkia Kouider; Preben D. Vestergaard (Australas. J Comb., 2003)

Even [a, b]-factors in graphs. - Mekkia Kouider; Preben D. Vestergaard (Discuss. Math. Graph Theory, 2004)

Dominating sets with at most k components. - Bert L. Hartnell; Preben D. Vestergaard (Ars Comb., 2005)

The number of independent sets in unicyclic graphs. - Anders Sune Pedersen; Preben D. Vestergaard (Discret. Appl. Math., 2005)

Connected Factors in Graphs - a Survey. - Mekkia Kouider; Preben D. Vestergaard (Graphs Comb., 2005)

Well-covered graphs and factors. - Bert Randerath; Preben D. Vestergaard (Discret. Appl. Math., 2006)

Generalized connected domination in graphs. - Mekkia Kouider; Preben D. Vestergaard (Discret. Math. Theor. Comput. Sci., 2006)

Largest Non-Unique Subgraphs. - Lars Døvling Andersen; Preben D. Vestergaard; Zsolt Tuza (Graphs Comb., 2006)

An Upper Bound on the Number of Independent Sets in a Tree. - Anders Sune Pedersen; Preben D. Vestergaard (Ars Comb., 2007)

Domination in partitioned graphs with minimum degree two. - Michael A. Henning; Preben D. Vestergaard (Discret. Math., 2007)

A short update on equipackable graphs. - Preben D. Vestergaard (Discret. Math., 2008)

Total domination in partitioned trees and partitioned graphs with minimum degree two. - Allan Frendrup; Michael A. Henning; Preben D. Vestergaard (J. Glob. Optim., 2008)

An upper bound on the domination number of a graph with minimum degree 2. - Allan Frendrup; Michael A. Henning; Bert Randerath; Preben D. Vestergaard (Discret. Math., 2009)

Total Domination in Partitioned Graphs. - Allan Frendrup; Preben D. Vestergaard; Anders Yeo (Graphs Comb., 2009)

A note on equimatchable graphs. - Allan Frendrup; Bert L. Hartnell; Preben D. Vestergaard (Australas. J Comb., 2010)

All P3-equipackable graphs. - Bert Randerath; Preben D. Vestergaard (Discret. Math., 2010)

Merrifield-Simmons index and minimum Number of Independent Sets in Short Trees. - Allan Frendrup; Anders Sune Pedersen; Alexander A. Sapozhenko; Preben D. Vestergaard (Ars Comb., 2013)