Equitable List Coloring of Graphs with Bounded Degree
From MaRDI portal
Publication:2862547
DOI10.1002/jgt.21710zbMath1276.05045OpenAlexW1950386464MaRDI QIDQ2862547
Henry A. Kierstead, Alexandr V. Kostochka
Publication date: 15 November 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21710
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items
Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ On Equitable List Arboricity of Graphs ⋮ Equitable list vertex colourability and arboricity of grids ⋮ A simple characterization of proportionally 2-choosable graphs ⋮ Total equitable list coloring ⋮ A note on the equitable choosability of complete bipartite graphs ⋮ On list equitable total colorings of the generalized theta graph ⋮ Proportional choosability: a new list analogue of equitable coloring ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
Cites Work
- A fast algorithm for equitable coloring
- Equitable list coloring of graphs
- Equitable list-coloring for graphs of maximum degree 3
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- A list analogue of equitable coloring
- Completely distributive CSL algebras with no complements in $\mathcal {C}_p$
- Perfect Graphs and an Application to Optimizing Municipal Services
This page was built for publication: Equitable List Coloring of Graphs with Bounded Degree
