default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPreben D. Vestergaard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j33]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: 85-95 (2013)- 2010
- [j32]Allan Frendrup, Bert L. Hartnell, Preben D. Vestergaard:
A note on equimatchable graphs. Australas. J Comb. 46: 185-190 (2010) - [j31]Bert Randerath, Preben D. Vestergaard:
All P3-equipackable graphs. Discret. Math. 310(2): 355-359 (2010)
2000 – 2009
- 2009
- [j30]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): 639-646 (2009) - [j29]Allan Frendrup, Preben D. Vestergaard, Anders Yeo:
Total Domination in Partitioned Graphs. Graphs Comb. 25(2): 181-196 (2009) - 2008
- [j28]Preben D. Vestergaard:
A short update on equipackable graphs. Discret. Math. 308(2-3): 161-165 (2008) - [j27]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): 385-399 (2008) - 2007
- [j26]Anders Sune Pedersen, Preben D. Vestergaard:
An Upper Bound on the Number of Independent Sets in a Tree. Ars Comb. 84 (2007) - [j25]Michael A. Henning, Preben D. Vestergaard:
Domination in partitioned graphs with minimum degree two. Discret. Math. 307(9-10): 1115-1135 (2007) - 2006
- [j24]Bert Randerath, Preben D. Vestergaard:
Well-covered graphs and factors. Discret. Appl. Math. 154(9): 1416-1428 (2006) - [j23]Mekkia Kouider, Preben D. Vestergaard:
Generalized connected domination in graphs. Discret. Math. Theor. Comput. Sci. 8(1): 57-64 (2006) - [j22]Lars Døvling Andersen, Preben D. Vestergaard, Zsolt Tuza:
Largest Non-Unique Subgraphs. Graphs Comb. 22(4): 453-470 (2006) - 2005
- [j21]Bert L. Hartnell, Preben D. Vestergaard:
Dominating sets with at most k components. Ars Comb. 74 (2005) - [j20]Anders Sune Pedersen, Preben D. Vestergaard:
The number of independent sets in unicyclic graphs. Discret. Appl. Math. 152(1-3): 246-256 (2005) - [j19]Mekkia Kouider, Preben D. Vestergaard:
Connected Factors in Graphs - a Survey. Graphs Comb. 21(1): 1-26 (2005) - 2004
- [j18]Mekkia Kouider, Preben D. Vestergaard:
Even [a, b]-factors in graphs. Discuss. Math. Graph Theory 24(3): 431-441 (2004) - 2003
- [j17]Mekkia Kouider, Preben D. Vestergaard:
On even [2, b]-factors in graphs. Australas. J Comb. 27: 139-148 (2003) - 2002
- [j16]Bert Randerath, Preben D. Vestergaard:
On well-covered graphs of odd girth 7 or greater. Discuss. Math. Graph Theory 22(1): 159-172 (2002) - [j15]Zsolt Tuza, Preben D. Vestergaard:
Domination in partitioned graphs. Discuss. Math. Graph Theory 22(1): 199-210 (2002) - 2000
- [j14]Jerzy Topp
, Preben D. Vestergaard:
alphak- and gammak-stable graphs. Discret. Math. 212(1-2): 149-160 (2000)
1990 – 1999
- 1998
- [j13]Jerzy Topp, Preben D. Vestergaard:
Interpolation theorems for the (r, s)-domination number of spanning trees. Australas. J Comb. 17: 99-108 (1998) - [j12]Jerzy Topp, Preben D. Vestergaard:
Interpolation theorems for domination numbers of a graph. Discret. Math. 191(1-3): 207-221 (1998) - 1997
- [j11]Jerzy Topp, Preben D. Vestergaard:
Totally equimatchable graphs. Discret. Math. 164(1-3): 285-290 (1997) - 1996
- [j10]Lars Døvling Andersen, Preben D. Vestergaard:
Graphs with all spanning trees nonisomorphic. Discret. Math. 155(1-3): 3-12 (1996) - [j9]Jerzy Topp, Preben D. Vestergaard:
On numbers of vertices of maximum degree in the spanning trees of a graph. Discret. Math. 155(1-3): 247-258 (1996) - [j8]Erich Prisner, Jerzy Topp, Preben D. Vestergaard:
Well covered simplicial, chordal, and circular arc graphs. J. Graph Theory 21(2): 113-119 (1996) - 1995
- [j7]Jerzy Topp, Preben D. Vestergaard:
Well Irredundant Graphs. Discret. Appl. Math. 63(3): 267-276 (1995) - 1994
- [j6]Preben D. Vestergaard:
Two-cacti with minimum number of spanning trees. Discret. Math. 124(1-3): 241-250 (1994) - 1993
- [j5]Jerzy Topp, Preben D. Vestergaard:
Odd factors of a graph. Graphs Comb. 9(2-4): 371-381 (1993) - 1992
- [j4]Yoshimi Egawa, Preben D. Vestergaard:
Spanning trees in a cactus. Discret. Math. 110(1-3): 269-274 (1992) - [j3]Lars Døvling Andersen, Songkang Ding, Gert Sabidussi, Preben D. Vestergaard:
Edge orbits and edge-deleted subgraphs. Graphs Comb. 8(1): 31-44 (1992) - 1991
- [j2]Preben D. Vestergaard:
Graphs with two isomorphism classes of spanning unicyclic subgraphs. Graphs Comb. 7(2): 197-204 (1991)
1980 – 1989
- 1988
- [j1]Preben D. Vestergaard:
Graphs with one isomorphism class of spanning unicyclic graphs. Discret. Math. 70(1): 103-108 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
