On a cycle partition problem

DOI10.1016/J.DISC.2007.12.002MaRDI QIDQ998373zbMATH OpenOpenAlexFDO

Authors Morten H. Nielsen

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

zbMATH Keywords

partitioncircumferencelongest cyclepath partition conjecturecycle partition

Mathematics Subject Classification ID

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

Recommendations

• A note on a cycle partition problem
• Cycle partition of two-connected and two-edge connected graphs
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Path partitioning planar graphs with restrictions on short cycles
• Path partitioning planar graphs of girth 4 without adjacent short cycles

Cites work

• scientific article; zbMATH DE number 3838057 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3557819 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• scientific article; zbMATH DE number 1416470 (Why is no real title available?)
• k-Degenerate Graphs
• A new approach to the path partition conjecture
• A note on triangle-free and bipartite graphs
• A path(ological) partition problem
• An asymptotic result for the path partition conjecture
• Decomposing a planar graph into degenerate graphs
• Detour saturated oriented graphs
• Graph Classes: A Survey
• Longest path partitions in generalizations of tournaments
• Path partitions and \(P_{n}\)-free sets
• Stable set meeting every longest path
• The directed path partition conjecture
• The path partition conjecture is true for claw-free graphs

Cited in

(7)

• Minimum cycle partition with length requirements
• Mad Tea Party Cyclic Partitions
• Cycle partition of two-connected and two-edge connected graphs
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Grinstead's conjecture is true for graphs with a small clique number
• A note on a cycle partition problem
• scientific article; zbMATH DE number 6928815 (Why is no real title available?)

This page was built for publication: On a cycle partition problem

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