Equitable colorings of planar graphs without short cycles

DOI10.1016/j.tcs.2012.09.014zbMath1253.05072arXiv1203.0379OpenAlexW2023311741MaRDI QIDQ1929237

Kittikorn Nakprasit, Keaitsuda Maneeruk Nakprasit

Publication date: 7 January 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.0379

zbMATH Keywords

cyclegirthplanar graphequitable coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

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 list vertex colourability and arboricity of grids ⋮ Tree-coloring problems of bounded treewidth graphs ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable colorings of planar graphs with maximum degree at least nine
• Equitable list colorings of planar graphs without short cycles
• Equitable list coloring of planar graphs without 4- and 6-cycles
• 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

This page was built for publication: Equitable colorings of planar graphs without short cycles