Long path connectivity of regular graphs (Q1186381)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Long path connectivity of regular graphs |
scientific article; zbMATH DE number 36533
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Long path connectivity of regular graphs |
scientific article; zbMATH DE number 36533 |
Statements
Long path connectivity of regular graphs (English)
0 references
28 June 1992
0 references
This paper is devoted to the following theorem: In a 4-connected non- bipartite \(k\)-regular graph, any pair of distinct vertices are joined by a Hamilton path or a path of length at least \(3k-6\). The proof (by contradiction) looks at lengths of segments of a longest path joining a pair of vertices.
0 references
long path connectivity
0 references
regular graphs
0 references
0 references
0 references
0 references
0.8943813
0 references
0 references
0 references
