Covering 2‐connected 3‐regular graphs with disjoint paths

DOI10.1002/jgt.22219zbMath1393.05218arXiv1806.07014OpenAlexW2963952043MaRDI QIDQ4581271

Gexin Yu

Publication date: 16 August 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.07014

zbMATH Keywords

regular graphspath coverdischarging

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (7)

Induced path factors of regular graphs ⋮ On the path partition number of 6‐regular graphs ⋮ On the path partition of graphs ⋮ Nontrivial path covers of graphs: existence, minimization and maximization ⋮ On the minimum leaf number of cubic graphs ⋮ Minimum path cover in quasi-claw-free graphs ⋮ Ramsey-type results for path covers and path partitions

This page was built for publication: Covering 2‐connected 3‐regular graphs with disjoint paths