Equitable list colorings of planar graphs without short cycles
From MaRDI portal
Publication:954980
DOI10.1016/j.tcs.2008.04.018zbMath1152.05027OpenAlexW2006947206MaRDI QIDQ954980
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.018
Related Items (17)
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ 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 ⋮ Equitable colorings of planar graphs without short cycles ⋮ Equitable vertex arboricity of graphs ⋮ Total equitable list coloring ⋮ On equitable and equitable list colorings of series-parallel graphs ⋮ On the equitable vertex arboricity of graphs ⋮ On the small cycle transversal of planar graphs ⋮ On the Small Cycle Transversal of Planar Graphs ⋮ New kernels for several problems on planar 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
- Choosability and edge choosability of planar graphs without five cycles
- 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
This page was built for publication: Equitable list colorings of planar graphs without short cycles
