Equitable and list equitable colorings of planar graphs without 4-cycles
From MaRDI portal
Publication:389204
DOI10.1016/j.disc.2013.04.011zbMath1279.05023OpenAlexW2019255250MaRDI QIDQ389204
Aijun Dong, Guang-Hui Wang, Guo Jun Li
Publication date: 17 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.011
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles
- On equitable and equitable list colorings of series-parallel graphs
- Equitable and equitable list colorings of graphs
- 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
- Equitable list coloring of graphs
- Equitable colorings of outerplanar graphs
- On equitable coloring of bipartite graphs
- Equitable coloring planar graphs with large girth
- Equitable list-coloring for graphs of maximum degree 3
- Equitable Coloring
- A list analogue of equitable coloring
- The infamous upper tail
- Equitable Colourings of d-degenerate Graphs
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
