The following pages link to Preben Dahl Vestergaard (Q870973):
Displaying 50 items.
- Domination in partitioned graphs with minimum degree two (Q870974) (← links)
- Largest non-unique subgraphs (Q882786) (← links)
- Total domination in partitioned trees and partitioned graphs with minimum degree two (Q934795) (← links)
- All \(P_{3}\)-equipackable graphs (Q960935) (← links)
- An upper bound on the domination number of a graph with minimum degree 2 (Q1011694) (← links)
- Total domination in partitioned graphs (Q1043811) (← links)
- (Q1111569) (redirect page) (← links)
- Graphs with one isomorphism class of spanning unicyclic graphs (Q1111570) (← links)
- Edge orbits and edge-deleted subgraphs (Q1187947) (← links)
- Spanning trees in a cactus (Q1208370) (← links)
- Doubly traversed Euler circuits (Q1214443) (← links)
- (Q1237988) (redirect page) (← links)
- Value-true walks in finite, connected, valuated graphs (Q1237989) (← links)
- Odd factors of a graph (Q1313354) (← links)
- Two-cacti with minimum number of spanning trees (Q1313842) (← links)
- Totally equimatchable graphs (Q1356717) (← links)
- Interpolation theorems for domination numbers of a graph (Q1584415) (← links)
- Connected factors in graphs -- a survey (Q1777234) (← links)
- Well irredundant graphs (Q1917235) (← links)
- Graphs with all spanning trees nonisomorphic (Q1923474) (← links)
- On numbers of vertices of maximum degree in the spanning trees of a graph (Q1923502) (← links)
- \(\alpha_k\)- and \(\gamma_k\)-stable graphs (Q1970587) (← links)
- Graphs with two isomorphism classes of spanning unicycle subgraphs (Q2277482) (← links)
- Bounds on the number of vertex independent sets in a graph (Q2372400) (← links)
- A short update on equipackable graphs (Q2467992) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- The number of independent sets in unicyclic graphs (Q2576351) (← links)
- (Q2931472) (← links)
- (Q3115050) (← links)
- (Q3312260) (← links)
- (Q3429506) (← links)
- (Q3476825) (← links)
- (Q3483316) (← links)
- (Q3565868) (← links)
- (Q3568726) (← links)
- (Q3792713) (← links)
- (Q3813839) (← links)
- (Q3835529) (← links)
- (Q3842521) (← links)
- (Q3968076) (← links)
- (Q4204164) (← links)
- (Q4379738) (← links)
- (Q4405642) (← links)
- (Q4457743) (← links)
- Even [a,b]-factors in graphs (Q4668428) (← links)
- (Q4711899) (← links)
- On well-covered graphs of odd girth 7 or greater (Q4786795) (← links)
- Domination in partitioned graphs (Q4786799) (← links)
- (Q4842744) (← links)
- (Q4857888) (← links)