On the maximum number of independent cycles in a graph
From MaRDI portal
Publication:1301840
DOI10.1016/S0012-365X(99)00009-6zbMath0936.05063OpenAlexW2087773671MaRDI QIDQ1301840
Publication date: 8 May 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00009-6
Related Items
A refinement of theorems on vertex-disjoint chorded cycles ⋮ 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 ⋮ Disjoint cycles in graphs with distance degree sum conditions ⋮ On degree sum conditions and vertex-disjoint chorded cycles ⋮ 2-factors in dense 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 the difference between Hamilton cycles and 2-factors with a prescribed number of 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 ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint cliques in claw-free graphs ⋮ On vertex-disjoint triangles in tripartite graphs and multigraphs ⋮ A 2-factor with short cycles passing through specified independent vertices in graph ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ Disjoint triangles and quadrilaterals in a graph ⋮ An improvement of Lichiardopol's theorem on disjoint cycles in tournaments ⋮ Chromatic number via Turán number ⋮ Graph partition into \(K_{3}\)s and \(K_{4}\)s ⋮ On the number of independent chorded cycles in a graph ⋮ Graph partition into small cliques ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles ⋮ Covering the vertices of a graph with cycles of bounded length ⋮ Partial Degree Conditions and Cycle Coverings ⋮ Neighborhood unions and disjoint chorded cycles in graphs ⋮ Disjoint cycles and \(2\)-factors with Fan-type condition in a graph ⋮ Ore-type conditions implying 2-factors consisting of short cycles ⋮ Triangles in claw-free graphs ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ Existence of two disjoint long cycles in graphs ⋮ Results and problems on chorded cycles: a survey ⋮ Recent Results on Disjoint Cycles in Graphs ⋮ Used car salesman problem: a differential auction-barter market
Cites Work
