Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
From MaRDI portal
Publication:2345542
DOI10.1007/s00373-013-1396-7zbMath1312.05058OpenAlexW2016619939MaRDI QIDQ2345542
Xiao Min, Yuehua Bu, Junlei Zhu
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1396-7
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
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 ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles
- A refinement of a result of Corrádi and Hajnal
- Equitable and equitable list colorings of graphs
- Equitable colorings of planar graphs with maximum degree at least nine
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Equitable list colorings of planar graphs without short cycles
- Equitable list coloring of planar graphs without 4- and 6-cycles
- 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 colorings of planar graphs without short cycles
- Equitable List Coloring of Graphs with Bounded Degree
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
- Equitable list-coloring for graphs of maximum degree 3
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Equitable Coloring
- A list analogue of equitable coloring
This page was built for publication: Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
