Equitable vertex arboricity of graphs with low maximum degree

DOI10.1007/S00373-025-02935-4MaRDI QIDQ6961744zbMATH OpenFDO

Authors Ping Chen, Weichan Liu, Xin Zhang

Publication date 10 July 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-025-02935-4

zbMATH Keywords

equitable partitionvertex arboricityvertex coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A conjecture on equitable vertex arboricity of graphs
• Equitable improper choosability of graphs
• Equitable list point arboricity of graphs
• Equitable list tree-coloring of bounded treewidth graphs
• Equitable list vertex colourability and arboricity of grids
• Equitable partition of planar graphs
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• Equitable vertex arboricity of 5-degenerate graphs
• Equitable vertex arboricity of graphs
• Equitable vertex arboricity of planar graphs
• Equitable vertex arboricity of subcubic graphs
• Hardness and algorithms of equitable tree-coloring problem in chordal graphs
• On equitable list arboricity of graphs
• On the equitable vertex arboricity of complete bipartite graphs
• On the equitable vertex arboricity of complete tripartite graphs
• On the equitable vertex arboricity of graphs
• The equitable vertex arboricity of complete tripartite graphs
• The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
• Theoretical aspects of equitable partition of networks into sparse modules
• Tree-coloring problems of bounded treewidth graphs

This page was built for publication: Equitable vertex arboricity of graphs with low maximum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6961744)