We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Covering 2‐connected 3‐regular graphs with disjoint paths.
- Authors
Yu, Gexin
- Abstract
Abstract: A path cover of a graph is a set of disjoint paths so that every vertex in the graph is contained in one of the paths. The path cover number p ( G ) of graph <italic>G</italic> is the cardinality of a path cover with the minimum number of paths. Reed in 1996 conjectured that a 2‐connected 3‐regular graph has path cover number at most ⌈ n / 10 ⌉. In this article, we confirm this conjecture.
- Subjects
GRAPH theory; PATHS &; cycles in graph theory; GEOMETRIC vertices; GRAPH connectivity; MATHEMATICAL connectedness; REGULAR graphs
- Publication
Journal of Graph Theory, 2018, Vol 88, Issue 3, p385
- ISSN
0364-9024
- Publication type
Article
- DOI
10.1002/jgt.22219