Equitable colorings of planar graphs with maximum degree at least nine

DOI10.1016/j.disc.2011.11.004zbMath1237.05085OpenAlexW2063653165MaRDI QIDQ764891

Kittikorn Nakprasit

Publication date: 16 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.004

zbMATH Keywords

planar graphsequitable colorings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (13)

The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ Equitable colorings of corona multiproducts of graphs ⋮ Equitable vertex arboricity of 5-degenerate graphs ⋮ Equitable colorings of planar graphs without short cycles ⋮ Equitable vertex arboricity of graphs ⋮ Equitable coloring of three classes of 1-planar graphs ⋮ Equitable partition of planar graphs ⋮ On equitable colorings of sparse graphs ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy ⋮ Equitable total-coloring of subcubic graphs ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles

Cites Work

• Equitable coloring and the maximum degree
• Equitable colorings of outerplanar graphs
• On equitable coloring of bipartite graphs
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Equitable Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable colorings of planar graphs with maximum degree at least nine