On the existence of disjoint cycles in a graph

DOI10.1007/s004930050034zbMath0924.05041OpenAlexW2041854775MaRDI QIDQ1307442

Hikoe Enomoto

Publication date: 31 October 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050034

zbMATH Keywords

vertex-disjoint cyclesextremal partitions

Mathematics Subject Classification ID

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

Related Items (45)

A refinement of theorems on vertex-disjoint chorded cycles ⋮ Unnamed Item ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ An Ore-type analogue of the Sauer-Spencer theorem ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ The confirmation of a conjecture on disjoint cycles in a graph ⋮ On degree sum conditions for 2-factors with a prescribed number of cycles ⋮ Disjoint cycles in graphs with distance degree sum conditions ⋮ On degree sum conditions and vertex-disjoint chorded cycles ⋮ Neighborhood unions for the existence of disjoint chorded cycles in graphs ⋮ Disjoint cycles and chorded cycles in a graph with given minimum degree ⋮ On a sharp degree sum condition for disjoint chorded cycles in graphs ⋮ Independence number and vertex-disjoint cycles ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ On vertex-disjoint cycles and degree sum conditions ⋮ Graphs containing every 2-factor ⋮ Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ On directed versions of the Corrádi-Hajnal corollary ⋮ On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles ⋮ A note on disjoint cycles ⋮ On the existence of vertex-disjoint subgraphs with high degree sum ⋮ Rooted prism-minors and disjoint cycles containing a specified edge ⋮ Covering vertices of a graph by \(k\) disjoint cycles ⋮ Fan-type condition on disjoint cycles in a graph ⋮ On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint cliques in claw-free graphs ⋮ Partition of a graph into cycles and degenerated cycles ⋮ On vertex-disjoint triangles in tripartite graphs and multigraphs ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ Subdivisions of graphs: A generalization of paths and cycles ⋮ Edge-dominating cycles in graphs ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ Packing disjoint cycles over vertex cuts ⋮ Disjoint cycles with chords in graphs ⋮ Degree condition for subdivisions of unicyclic graphs ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles ⋮ Covering the vertices of a graph with cycles of bounded length ⋮ Neighborhood unions and disjoint chorded cycles in graphs ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Existence of two disjoint long cycles in graphs ⋮ Results and problems on chorded cycles: a survey ⋮ Recent Results on Disjoint Cycles in Graphs

This page was built for publication: On the existence of disjoint cycles in a graph