Equitable vertex arboricity conjecture holds for graphs with low degeneracy

DOI10.1007/s10114-021-0663-4zbMath1473.05098arXiv1908.05066OpenAlexW3197826830WikidataQ113904804 ScholiaQ113904804MaRDI QIDQ2230570

Xin Zhang, Bei Niu, Yan Li, Bi Li

Publication date: 24 September 2021

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

degeneracyequitable coloringvertex arboricitytree-coloring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

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
• Equitable vertex arboricity of subcubic graphs
• Equitable vertex arboricity of graphs
• Equitable vertex arboricity of planar graphs
• Equitable improper choosability of graphs
• Equitable list tree-coloring of bounded treewidth graphs
• Tree-coloring problems of bounded treewidth graphs
• Equitable partition of graphs into induced linear forests
• Analyzing lattice networks through substructures
• The linear \((n - 1)\)-arboricity of some lexicographic product graphs
• Equitable partition of graphs into induced forests
• Equitable vertex arboricity of 5-degenerate graphs
• A conjecture on equitable vertex arboricity of graphs
• Equitable Colourings of d-degenerate Graphs
• On Equitable List Arboricity of Graphs
• Equitable list vertex colourability and arboricity of grids
• Equitable list point arboricity of graphs
• The Point-Arboricity of Planar Graphs