Graphs with not all possible path-kernels

DOI10.1016/j.disc.2004.02.012zbMath1066.05107OpenAlexW2026328547WikidataQ56926698 ScholiaQ56926698MaRDI QIDQ1877673

Carsten Thomassen, R. E. L. Aldred

Publication date: 19 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.02.012

zbMATH Keywords

path partition conjecture

Mathematics Subject Classification ID

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

Related Items (5)

The path partition conjecture is true for claw-free graphs ⋮ A note on a cycle partition problem ⋮ A note on path kernels and partitions ⋮ A note on the path Kernel conjecture ⋮ On a tree-partition problem

Cites Work

• Hypohamiltonian and hypotraceable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with not all possible path-kernels