The path partition conjecture is true for claw-free graphs

DOI10.1016/J.DISC.2005.11.065MaRDI QIDQ878616zbMATH OpenOpenAlexWikidataFDO

Authors Marietjie Frick, Jean E. Dunbar

Publication date 26 April 2007

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

claw-free graphslongest pathpath partition conjecturedetour order

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7768372
• scientific article; zbMATH DE number 1487881
• The \(k\)-in-a-path problem for claw-free graphs
• The \(k\)-in-a-path problem for claw-free graphs
• Path factors in claw-free graphs
• The Path Partition Conjecture is true for some generalizations of tournaments
• On the path partition of graphs
• Vizing's conjecture: A two-thirds bound for claw-free graphs
• On the Erdős-Gyárfás conjecture in claw-free graphs
• Induced disjoint paths in claw-free graphs

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 944226 (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?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• scientific article; zbMATH DE number 3276423 (Why is no real title available?)
• A path(ological) partition problem
• A survey of hereditary properties of graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• Detour Chromatic Numbers
• Graphs with not all possible path-kernels
• On a closure concept in claw-free graphs
• Partition problems and kernels of graphs
• Path partitions and \(P_{n}\)-free sets

Cited in

(17)

• On a tree-partition problem
• Cycles in \(k\)-traceable oriented graphs
• Detour Chromatic Numbers
• Path partitionable graphs
• Path partitioning planar graphs of girth 4 without adjacent short cycles
• On a cycle partition problem
• A note on path kernels and partitions
• A note on the path Kernel conjecture
• Cycle partition of two-connected and two-edge connected graphs
• Path partitioning planar graphs with restrictions on short cycles
• Path partitions and \(P_{n}\)-free sets
• A new approach to the path partition conjecture
• Vertex-disjoint subgraphs with high degree sums
• An asymptotic result for the path partition conjecture
• A note on a cycle partition problem
• On the existence of vertex-disjoint subgraphs with high degree sum
• My top 10 graph theory conjectures and open problems

This page was built for publication: The path partition conjecture is true for claw-free graphs

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