On a cycle partition problem
From MaRDI portal
Publication:998373
DOI10.1016/j.disc.2007.12.002zbMath1158.05037OpenAlexW2058216532MaRDI QIDQ998373
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.002
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
A note on a cycle partition problem ⋮ Cycle partition of two-connected and two-edge connected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The path partition conjecture is true for claw-free graphs
- Path partitions and \(P_{n}\)-free sets
- Stable set meeting every longest path
- A note on triangle-free and bipartite graphs
- Decomposing a planar graph into degenerate graphs
- Longest path partitions in generalizations of tournaments
- An asymptotic result for the path partition conjecture
- A path(ological) partition problem
- Graph Classes: A Survey
- The directed path partition conjecture
- k-Degenerate Graphs
This page was built for publication: On a cycle partition problem