Induced path factors of regular graphs

DOI10.1002/jgt.22654zbMath1521.05148arXiv1809.04394MaRDI QIDQ6055940

Saieed Akbari, Ian M. Wanless, Daniel Horsley

Publication date: 29 September 2023

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

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

zbMATH Keywords

coveringregular graphpath factorsubcubic graphinduced path

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates
• Induced-path partition on graphs with special blocks
• Splitting a graph into disjoint induced paths or cycles.
• On the minimum leaf number of cubic graphs
• Path factors in cubic graphs
• Spanning even subgraphs of 3‐edge‐connected graphs
• Covering 2‐connected 3‐regular graphs with disjoint paths
• Paths, Stars and the Number Three

This page was built for publication: Induced path factors of regular graphs