Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy

DOI10.1016/j.tcs.2021.12.012OpenAlexW4200483390MaRDI QIDQ2072075

Bei Niu, Xin Zhang, Huaqiang Zhang, Bi Li

Publication date: 1 February 2022

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.12.012

zbMATH Keywords

equitable coloringdegenerate graphtree coloringnetwork partitioncubic-time algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Equitable vertex arboricity of graphs
• Equitable vertex arboricity of planar graphs
• Equitable colorings of planar graphs with maximum degree at least nine
• Equitable partition of planar graphs
• Theoretical aspects of equitable partition of networks into sparse modules
• Equitable improper choosability of graphs
• Equitable list tree-coloring of bounded treewidth graphs
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• Equitable partition of graphs into induced forests
• Graph Theory
• Smallest-last ordering and clustering and graph coloring algorithms
• Equitable Coloring
• Equitable Colourings of d-degenerate Graphs
• Equitable d-degenerate Choosability of Graphs
• Equitable list vertex colourability and arboricity of grids
• Equitable list point arboricity of graphs
• On Equitable Coloring of d-Degenerate Graphs

This page was built for publication: Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy