Name
Abstract | ||
|---|---|---|
Let G be a 2-connected graph on n vertices such that d ( x ) + d ( y ) + d ( z ) ⩾ n for all triples of independent vertices x , y , z . We prove that every longest cycle in G is a dominating cycle unless G is a spanning subgraph of a graph belonging to one of four easily specified classes of graphs. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0012-365X(94)00364-O | Discrete Mathematics |
Keywords | Field | DocType |
2-connected graph,connected graph | Pseudoforest,Wheel graph,Discrete mathematics,Combinatorics,Dominating set,Graph power,Cycle graph,Distance-hereditary graph,Factor-critical graph,Mathematics,Pancyclic graph | Journal |
Volume | Issue | ISSN |
155 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
3 | 1.20 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. Bauer | 1 | 204 | 38.81 |
| Edward F. Schmeichel | 2 | 155 | 20.23 |
| H. J. Veldman | 3 | 262 | 44.44 |