Equitable colorings of planar graphs with maximum degree at least nine
From MaRDI portal
Publication:764891
DOI10.1016/j.disc.2011.11.004zbMath1237.05085MaRDI QIDQ764891
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
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C07: Vertex degrees
Related Items
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms, The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, Equitable vertex arboricity of graphs, On equitable colorings of sparse graphs, Equitable coloring and equitable choosability of graphs with small maximum average degree, Equitable coloring of three classes of 1-planar graphs, Equitable colorings of planar graphs without short cycles, Equitable partition of planar graphs, 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, Equitable colorings of corona multiproducts of graphs, Equitable vertex arboricity of 5-degenerate graphs
Cites Work
