Preben Dahl Vestergaard

From MaRDI portal
Revision as of 01:34, 13 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Preben Dahl Vestergaard to Preben Dahl Vestergaard: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:870973

Available identifiers

zbMath Open vestergaard.preben-dahlMaRDI QIDQ870973

List of research outcomes

PublicationDate of PublicationType
Distance Domination in Vertex Partitioned Graphs2022-05-09Paper
https://portal.mardi4nfdi.de/entity/Q29314722014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q31150502012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q35687262010-06-15Paper
https://portal.mardi4nfdi.de/entity/Q35658682010-06-07Paper
All \(P_{3}\)-equipackable graphs2010-03-29Paper
Total domination in partitioned graphs2009-12-09Paper
An upper bound on the domination number of a graph with minimum degree 22009-04-09Paper
https://portal.mardi4nfdi.de/entity/Q55033382009-01-15Paper
Total domination in partitioned trees and partitioned graphs with minimum degree two2008-07-30Paper
https://portal.mardi4nfdi.de/entity/Q53876662008-05-27Paper
A short update on equipackable graphs2008-01-30Paper
Bounds on the number of vertex independent sets in a graph2007-07-26Paper
Largest non-unique subgraphs2007-05-24Paper
https://portal.mardi4nfdi.de/entity/Q34295062007-04-02Paper
Domination in partitioned graphs with minimum degree two2007-03-15Paper
https://portal.mardi4nfdi.de/entity/Q54806882006-08-03Paper
Well-covered graphs and factors2006-06-09Paper
The number of independent sets in unicyclic graphs2005-12-27Paper
https://portal.mardi4nfdi.de/entity/Q54635592005-08-04Paper
Connected factors in graphs -- a survey2005-05-12Paper
Even [a,b-factors in graphs]2005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q44577432004-03-25Paper
Domination in partitioned graphs2003-08-07Paper
https://portal.mardi4nfdi.de/entity/Q44056422003-06-23Paper
On well-covered graphs of odd girth 7 or greater2003-06-13Paper
Interpolation theorems for domination numbers of a graph2000-11-02Paper
\(\alpha_k\)- and \(\gamma_k\)-stable graphs2000-09-05Paper
https://portal.mardi4nfdi.de/entity/Q38425211999-07-05Paper
https://portal.mardi4nfdi.de/entity/Q43797381998-06-29Paper
Totally equimatchable graphs1997-10-26Paper
Graphs with all spanning trees nonisomorphic1997-03-23Paper
On numbers of vertices of maximum degree in the spanning trees of a graph1996-10-07Paper
Well irredundant graphs1996-07-07Paper
https://portal.mardi4nfdi.de/entity/Q48578881996-06-05Paper
https://portal.mardi4nfdi.de/entity/Q48427441996-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48737811996-04-22Paper
Well covered simplicial, chordal, and circular arc graphs1996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48745841996-01-01Paper
Odd factors of a graph1994-09-11Paper
Two-cacti with minimum number of spanning trees1994-05-15Paper
Spanning trees in a cactus1993-05-16Paper
Edge orbits and edge-deleted subgraphs1992-08-03Paper
https://portal.mardi4nfdi.de/entity/Q47118991992-06-25Paper
Graphs with two isomorphism classes of spanning unicycle subgraphs1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34768251989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38355291989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42041641989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022191989-01-01Paper
Graphs with one isomorphism class of spanning unicyclic graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34833161988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37927131988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38138391987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33122601982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39680761982-01-01Paper
Value-true walks in finite, connected, valuated graphs1977-01-01Paper
Doubly traversed Euler circuits1975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Preben Dahl Vestergaard