Partitioning a graph into two square-cycles

DOI10.1002/(SICI)1097-0118(199611)23:3%3C241::AID-JGT4%3E3.0.CO;2-SMaRDI QIDQ4715278zbMATH OpenOpenAlexFDO

Authors Genghua Fan, H. A. Kierstead

Publication date 16 December 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199611)23:3%3C241::aid-jgt4%3E3.0.co;2-s

zbMATH Keywords

cycleminimum degreepowers of graphsPósa conjecturesquare-cycle

Mathematics Subject Classification ID

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

Recommendations

• Partition of a bipartite graph into cycles
• Partition of a graph into cycles and vertices
• Cycle partition of two-connected and two-edge connected graphs
• scientific article; zbMATH DE number 2101287
• Cycle Partitions in Graphs
• scientific article; zbMATH DE number 2186975
• Partition of a directed bipartite graph into two directed cycles
• Partition of a bipartite Hamiltonian graph into two cycles
• Partitioning a graph into a cycle and a sparse graph
• Partition of a graph into cycles and degenerated cycles

Cited in

(9)

• Partition of a bipartite Hamiltonian graph into two cycles
• Square Hamiltonian cycles in graphs with maximal 4-cliques
• The square of paths and cycles
• On degree sequences forcing the square of a Hamilton cycle
• On a degree sequence analogue of Pósa's conjecture
• An Ore-type theorem on Hamiltonian square cycles
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• Cyclic base ordering of certain degenerate graphs
• How to avoid using the regularity Lemma: Pósa's conjecture revisited

This page was built for publication: Partitioning a graph into two square-cycles

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