On the strong path partition conjecture

DOI10.7151/DMGT.2468MaRDI QIDQ6985916zbMATH OpenFDO

Authors Johan P. de Wet, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2468

zbMATH Keywords

longest pathstrong path partition conjecture

Mathematics Subject Classification ID

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

Cites work

• A new approach to the path partition conjecture
• A note on the path Kernel conjecture
• An asymptotic result for the path partition conjecture
• Graphs with not all possible path-kernels
• scientific article; zbMATH DE number 3838057 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 1416470 (Why is no real title available?)
• Partition problems and kernels of graphs
• Path partitions and \(P_{n}\)-free sets
• The Path Partition Conjecture
• The path partition conjecture is true for claw-free graphs

Cited in

(1)

• The strong path partition conjecture holds for a = 9

This page was built for publication: On the strong path partition conjecture

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