| 2008 |
|---|
| 17 | EE | Preben D. Vestergaard:
A short update on equipackable graphs.
Discrete Mathematics 308(2-3): 161-165 (2008) |
| 2007 |
|---|
| 16 | | Anders Sune Pedersen,
Preben D. Vestergaard:
An Upper Bound on the Number of Independent Sets in a Tree.
Ars Comb. 84: (2007) |
| 15 | EE | Michael A. Henning,
Preben D. Vestergaard:
Domination in partitioned graphs with minimum degree two.
Discrete Mathematics 307(9-10): 1115-1135 (2007) |
| 2006 |
|---|
| 14 | EE | Bert Randerath,
Preben D. Vestergaard:
Well-covered graphs and factors.
Discrete Applied Mathematics 154(9): 1416-1428 (2006) |
| 13 | EE | Mekkia Kouider,
Preben D. Vestergaard:
Generalized connected domination in graphs.
Discrete Mathematics & Theoretical Computer Science 8(1): 57-64 (2006) |
| 2005 |
|---|
| 12 | | Bert Hartnell,
Preben D. Vestergaard:
Dominating sets with at most k components.
Ars Comb. 74: (2005) |
| 11 | EE | Anders Sune Pedersen,
Preben D. Vestergaard:
The number of independent sets in unicyclic graphs.
Discrete Applied Mathematics 152(1-3): 246-256 (2005) |
| 10 | EE | Mekkia Kouider,
Preben D. Vestergaard:
Connected Factors in Graphs - a Survey.
Graphs and Combinatorics 21(1): 1-26 (2005) |
| 2000 |
|---|
| 9 | EE | Jerzy Topp,
Preben D. Vestergaard:
alphak- and gammak-stable graphs.
Discrete Mathematics 212(1-2): 149-160 (2000) |
| 1998 |
|---|
| 8 | EE | Jerzy Topp,
Preben D. Vestergaard:
Interpolation theorems for domination numbers of a graph.
Discrete Mathematics 191(1-3): 207-221 (1998) |
| 1997 |
|---|
| 7 | EE | Jerzy Topp,
Preben D. Vestergaard:
Totally equimatchable graphs.
Discrete Mathematics 164(1-3): 285-290 (1997) |
| 1996 |
|---|
| 6 | EE | Jerzy Topp,
Preben D. Vestergaard:
On numbers of vertices of maximum degree in the spanning trees of a graph.
Discrete Mathematics 155(1-3): 247-258 (1996) |
| 5 | EE | Lars Døvling Andersen,
Preben D. Vestergaard:
Graphs with all spanning trees nonisomorphic.
Discrete Mathematics 155(1-3): 3-12 (1996) |
| 1995 |
|---|
| 4 | EE | Jerzy Topp,
Preben D. Vestergaard:
Well Irredundant Graphs.
Discrete Applied Mathematics 63(3): 267-276 (1995) |
| 1994 |
|---|
| 3 | EE | Preben D. Vestergaard:
Two-cacti with minimum number of spanning trees.
Discrete Mathematics 124(1-3): 241-250 (1994) |
| 1992 |
|---|
| 2 | EE | Yoshimi Egawa,
Preben D. Vestergaard:
Spanning trees in a cactus.
Discrete Mathematics 110(1-3): 269-274 (1992) |
| 1988 |
|---|
| 1 | EE | Preben D. Vestergaard:
Graphs with one isomorphism class of spanning unicyclic graphs.
Discrete Mathematics 70(1): 103-108 (1988) |
