Equitable and equitable list colorings of graphs
From MaRDI portal
Publication:604470
DOI10.1016/j.tcs.2010.06.027zbMath1198.05074OpenAlexW1974896302MaRDI QIDQ604470
Publication date: 11 November 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.027
Related Items (10)
Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ On Equitable List Arboricity of Graphs ⋮ A simple characterization of proportionally 2-choosable graphs ⋮ Equitable and list equitable colorings of planar graphs without 4-cycles ⋮ Total equitable list coloring ⋮ On equitable and equitable list colorings of series-parallel graphs ⋮ 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
- Equitable coloring of trees
- Equitable coloring and the maximum degree
- Equitable list coloring of graphs
- On equitable coloring of bipartite graphs
- Equitable list-coloring for graphs of maximum degree 3
- Equitable Coloring
- A list analogue of equitable coloring
- Equitable Colourings of d-degenerate Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equitable and equitable list colorings of graphs