The path partition conjecture is true for claw-free graphs
From MaRDI portal
Publication:878616
DOI10.1016/J.DISC.2005.11.065zbMATH Open1121.05092OpenAlexW2035713312WikidataQ123283230 ScholiaQ123283230MaRDI QIDQ878616FDOQ878616
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
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- On a closure concept in claw-free graphs
- Title not available (Why is that?)
- A survey of hereditary properties of graphs
- Title not available (Why is that?)
- Closure and stable Hamiltonian properties in claw-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Path partitions and \(P_{n}\)-free sets
- Graphs with not all possible path-kernels
- Title not available (Why is that?)
- Title not available (Why is that?)
- A path(ological) partition problem
- Detour Chromatic Numbers
- Partition problems and kernels of graphs
Cited In (17)
- On a tree-partition problem
- Detour Chromatic Numbers
- Cycles in \(k\)-traceable oriented graphs
- 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
- Cycle partition of two-connected and two-edge connected graphs
- A note on the path Kernel conjecture
- Path partitioning planar graphs with restrictions on short cycles
- A new approach to the path partition conjecture
- Path partitions and \(P_{n}\)-free sets
- 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)
