The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Preben D. Vestergaard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  16. An Upper Bound on the Number of Independent Sets in a Tree. [Citation Graph (, )][DBLP]


  17. A short update on equipackable graphs. [Citation Graph (, )][DBLP]


  18. An upper bound on the domination number of a graph with minimum degree 2. [Citation Graph (, )][DBLP]


  19. All P3-equipackable graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002