Equitable Vertex Arboricity Conjecture Holds for Graphs with Low Degeneracy

The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations. Namely, an equitable tree-k-coloring of a graph is a vertex coloring using k distinct colors such that every color class induces a forest and the sizes of any two color classes differ by at most one. In this paper, we show some theoretical results on the equitable tree-coloring of graphs by proving that every d-degenerate graph with maximum degree at most Δ is equitably tree-k-colorable for every integer k ≥ (Δ + 1)/2 provided that Δ ≥ 9.818d, confirming the equitable vertex arboricity conjecture for graphs with low degeneracy.

[1]  Feodor F. Dragan,et al.  Metric tree‐like structures in real‐world networks: an empirical study , 2016, Networks.

[2]  Xin Zhang,et al.  Equitable vertex arboricity of graphs , 2013, Discret. Math..

[3]  Rong-Xia Hao,et al.  The linear (n-1)-arboricity of some lexicographic product graphs , 2018, Appl. Math. Comput..

[4]  Xin Zhang.  Equitable vertex arboricity of subcubic graphs , 2016, Discret. Math..

[5]  Ewa Drgas-Burchardt,et al.  Equitable improper choosability of graphs , 2020, Theor. Comput. Sci..

[6]  Yan Li,et al.  Equitable list tree-coloring of bounded treewidth graphs , 2021, Theor. Comput. Sci..

[7]  Alexandr V. Kostochka,et al.  Equitable Colourings of d-degenerate Graphs , 2003, Combinatorics, Probability and Computing.

[8]  Xin Zhang.  Equitable vertex arboricity of planar graphs , 2014, ArXiv.

[9]  Jeffrey A. Mudrock,et al.  On Equitable List Arboricity of Graphs , 2020, 2008.08926.

[10]  G. Chartrand,et al.  The Point‐Arboricity of Planar Graphs , 1969 .

[11]  Tao Li,et al.  Analyzing lattice networks through substructures , 2018, Appl. Math. Comput..

[12]  Xin Zhang,et al.  Equitable tree-$O(d)$-coloring of $d$-degenerate graphs , 2019, ArXiv.

[13]  E. Drgas-Burchardt,et al.  Equitable d-degenerate Choosability of Graphs , 2020, IWOCA.

[14]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[15]  Bi Li,et al.  Tree-coloring problems of bounded treewidth graphs , 2019, J. Comb. Optim..

[16]  Qi Zhang,et al.  Optimal Representation for Web and Social Network Graphs Based on ${K}^{2}$ -Tree , 2019, IEEE Access.

[17]  Boming Yu,et al.  Optimal structure of damaged tree-like branching networks for the equivalent thermal conductivity , 2016 .

[18]  Xin Zhang.  Equitable list point arboricity of graphs , 2014, ArXiv.

[19]  Xin Zhang,et al.  Equitable partition of graphs into induced linear forests , 2020, J. Comb. Optim..

[20]  Guanghui Wang,et al.  Equitable vertex arboricity of 5-degenerate graphs , 2017, J. Comb. Optim..

[21]  Xin Zhang,et al.  A conjecture on equitable vertex arboricity of graphs , 2012, ArXiv.

[22]  Ewa Drgas-Burchardt,et al.  Equitable List Vertex Colourability and Arboricity of Grids , 2018 .

[23]  Louis Esperet,et al.  Equitable partition of graphs into induced forests , 2015, Discret. Math..