Equitable partition of planar graphs

DOI10.1016/j.disc.2021.112351zbMath1462.05299arXiv1907.09911OpenAlexW3134869969MaRDI QIDQ2022132

Ringi Kim, Xin Zhang, Sang-il Oum

Publication date: 28 April 2021

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

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

zbMATH Keywords

planar graphequitable partitioninduced forestdegenerate graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Theoretical aspects of equitable partition of networks into sparse modules, Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable vertex arboricity of graphs
• A result on linear coloring of planar graphs
• Equitable vertex arboricity of planar graphs
• A fast algorithm for equitable coloring
• Equitable defective coloring of sparse planar graphs
• Equitable colorings of planar graphs with maximum degree at least nine
• Equitable coloring and the maximum degree
• Decomposing a planar graph into degenerate graphs
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• Equitable partition of graphs into induced forests
• Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Equitable Coloring
• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
• On Equitable Coloring of d-Degenerate Graphs
• The Point-Arboricity of Planar Graphs
• Acyclic colorings of planar graphs