Graphs with not all possible path-kernels

DOI10.1016/J.DISC.2004.02.012MaRDI QIDQ1877673zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Recommendations

• Publication:4943521
• A note on the path Kernel conjecture
• Partition problems and kernels of graphs
• Path partitions and \(P_{n}\)-free sets
• A path(ological) partition problem

Cites work

• scientific article; zbMATH DE number 3838057 (Why is no real title available?)
• scientific article; zbMATH DE number 3926824 (Why is no real title available?)
• scientific article; zbMATH DE number 1416470 (Why is no real title available?)
• Hypohamiltonian and hypotraceable graphs

Cited in

(9)

• scientific article; zbMATH DE number 1416470 (Why is no real title available?)
• On a tree-partition problem
• A note on path kernels and partitions
• On the strong path partition conjecture
• A note on the path Kernel conjecture
• A note on a cycle partition problem
• On the Forking Path Conjecture
• The path partition conjecture is true for claw-free graphs
• The strong path partition conjecture holds for a = 9

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

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