Path partitions of almost regular graphs

MaRDI QIDQ2800782zbMATH OpenFDO

Authors Colton Magnant, Hua Wang, Shuai Yuan

Publication date 18 April 2016

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au//pdf/64/ajc_v64_p334.pdf

zbMATH Keywords

path partition number of a graph

Mathematics Subject Classification ID

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

Recommendations

• On the path partition of graphs
• Gallai's conjecture for disconnected graphs
• On the path partition number of 6‐regular graphs
• The Path Partition Conjecture
• Conditions for graphs to be path partition optimal

Cited in

(10)

• Path partitions and packs of acyclic digraphs
• Enumerating consecutive and nested partitions for graphs
• Efficient algorithms for path partitions
• Extremal k-forcing sets in oriented graphs
• On path partitions of the divisor graph
• On the path partition number of 6‐regular graphs
• On the path partition of graphs
• A Hall-type condition for path covers in bipartite graphs
• The decycling number of a line graph
• Cycle partitions in dense regular digraphs and oriented graphs

This page was built for publication: Path partitions of almost regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800782)