Long Path Connectivity of Regular Graphs
Abstract
Any pair of vertices in a 4-connected, non-bipartite, k-regular graph are joined by a Hamilton path or a path of length at least 3k-6.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 15, 1989
- Accession Number
- ADA216477
Entities
People
- Cun-quan Zhang
- Yong-jin Zhu
Organizations
- West Virginia University