On the path partition number of 6‐regular graphs

DOI10.1002/jgt.22830zbMath1522.05373arXiv1911.08397OpenAlexW2991566882WikidataQ114236134 ScholiaQ114236134MaRDI QIDQ6057632

Unnamed Author, Uriel Feige

Publication date: 5 October 2023

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

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

zbMATH Keywords

regular graphslinear arboricitypath partitionpath partition number

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
• Unnamed Item
• Unnamed Item
• Matching and edge-connectivity in regular graphs
• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
• Arc coverings of graphs
• The linear arboricity of graphs
• Optimal path cover problem on block graphs and bipartite permutation graphs
• Optimal path cover problem on block graphs
• Towards the linear arboricity conjecture
• Covering the vertices of a graph by vertex-disjoint paths
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• The linear arboricity of some regular graphs
• Covering and packing in graphs IV: Linear arboricity
• Almost all regular graphs are hamiltonian
• Covering 2‐connected 3‐regular graphs with disjoint paths
• Paths, Stars and the Number Three
• The $L(2,1)$-Labeling Problem on Graphs
• Short Tours through Large Linear Forests
• COVERING AND PACKING IN GRAPHS, I.
• Some Theorems on Abstract Graphs

This page was built for publication: On the path partition number of 6‐regular graphs