A refinement of a result of Corrádi and Hajnal
From MaRDI portal
Publication:520047
DOI10.1007/s00493-014-3059-6zbMath1374.05091OpenAlexW1988551992MaRDI QIDQ520047
Alexandr V. Kostochka, Henry A. Kierstead
Publication date: 31 March 2017
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-014-3059-6
Related Items (9)
On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Disjoint cycles and chorded cycles in a graph with given minimum degree ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ Rooted prism-minors and disjoint cycles containing a specified edge ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for equitable coloring
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Spanning subgraphs of random graphs
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- \(H\)-factors in dense graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- An Ore-type theorem on equitable coloring
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- A list analogue of equitable coloring
- The infamous upper tail
- Perfect Graphs and an Application to Optimizing Municipal Services
- On the maximal number of independent circuits in a graph
This page was built for publication: A refinement of a result of Corrádi and Hajnal
