A refinement of a result of Corrádi and Hajnal
From MaRDI portal
Publication:520047
DOI10.1007/S00493-014-3059-6zbMATH Open1374.05091OpenAlexW1988551992MaRDI QIDQ520047FDOQ520047
Authors: H. A. Kierstead, Alexandr Kostochka 
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
Recommendations
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- An Ore-type theorem on equitable coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- On equitable \(\Delta\)-coloring of graphs with low average degree
Cites Work
- \(H\)-factors in dense graphs
- An Ore-type theorem on equitable coloring
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Title not available (Why is that?)
- On the maximal number of independent circuits in a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equitable coloring and the maximum degree
- On equitable coloring of bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spanning subgraphs of random graphs
- Title not available (Why is that?)
- Perfect Graphs and an Application to Optimizing Municipal Services
- Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
- Extremal graph packing problems: Ore-type versus Dirac-type
- A fast algorithm for equitable coloring
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- The infamous upper tail
- A list analogue of equitable coloring
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
Cited In (10)
- Equitable coloring of three classes of 1-planar graphs
- Rooted prism-minors and disjoint cycles containing a specified edge
- Disjoint cycles and chorded cycles in a graph with given minimum degree
- Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
- A greedy algorithm for the social golfer and the Oberwolfach problem
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
- A one-parameter refinement of the Razumov-Stroganov correspondence
- A sharp Dirac-Erdős type bound for large graphs
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- On the Corrádi-Hajnal theorem and a question of Dirac
This page was built for publication: A refinement of a result of Corrádi and Hajnal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520047)
