Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
From MaRDI portal
Publication:555496
DOI10.1007/s00493-010-2420-7zbMath1240.05089OpenAlexW2125772985WikidataQ123233448 ScholiaQ123233448MaRDI QIDQ555496
Henry A. Kierstead, Alexandr V. Kostochka
Publication date: 22 July 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-010-2420-7
Related Items (12)
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Disjoint cycles and chorded cycles in a graph with given minimum degree ⋮ Equitable \(\Delta\)-coloring of graphs ⋮ A note on relaxed equitable coloring of graphs ⋮ Equivalence of two conjectures on equitable coloring of graphs ⋮ An Ore-type theorem on equitable coloring ⋮ A refinement of a result of Corrádi and Hajnal ⋮ Total equitable list coloring ⋮ Ore-type versions of Brooks' theorem ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ On the equitable choosability of the disjoint union of stars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Spanning subgraphs of random graphs
- Almost \(H\)-factors in dense graphs
- Proof of the Seymour conjecture for large 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
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- The infamous upper tail
- Perfect Graphs and an Application to Optimizing Municipal Services
- Some Theorems on Abstract Graphs
This page was built for publication: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
