Abstract
This note provides a new perspective, i.e., graph embeddings on the decycling number \(\nabla (G)\) (Beineke and Vandell in J Graph Theory 25:59–77, 1997) of a graph G. For this point, it is shown that \(\nabla (G)=\gamma _M(G)+\xi (G)\) for any cubic graph G and \(|S|=\frac{\beta (G)+m(S)}{k-1}\) for any decycling set S of a k-regular graph G, where \(\gamma _M(G)\), \(\xi (G)\), \(\beta (G)\) and \(m(S)=c(G-S)+|E(S)|-1\) (\(c(G-S)\) is the number of components of \(G-S\) and |E(S)| is the number of edges in a subgraph G[S]) are, respectively, the maximum genus, the Betti deficiency (Xuong in J Combin Theory Ser B 26:217–225, 1979), the cycle rank (Harary in Graph theory, Academic Press, New York, 1967) and the margin number of G. Meanwhile, we further confirm that (1) a cubic graph G (\(G\ne K_4\)) has a vertex partition \((V_1, V_2)\) such that \(V_1\) is an independent set and \(V_2\) induces a forest and (2) a k-regular graph G with \(\nabla (G)=\frac{\beta (G)+m(S)}{k-1}\) (\(m(S)\le 2\)) has a vertex partition \((S,G-S)\) such that G[S] contains at most two edges and \(G-S\) induces a forest, where S is the smallest decycling set of G. Resorting to the above vertex partitions, we get the adjacent vertex distinguishing (AVD) total chromatic numbers of some families of graphs, and these results verify Zhang’s conjecture (Zhang in Sci China Ser A 48:289–299, 2005) that every graph with maximum degree \(\Delta \) has an AVD-total \((\Delta +3)\)-coloring.
Similar content being viewed by others
References
Beineke, L., Vandell, R.: Decycling graphs. J. Graph Theory 25, 59–77 (1997)
Chen, X.: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\Delta (G)=3\). Discrete Math. 308, 4003–4007 (2009)
Harary, F.: Graph theory. Academic Press, New York (1967)
Huang, D., Wang, W., Yan, C.: A note on the adjacent vertex distinguishing total chromatic number of graphs. Discrete Math. 312, 3544–3546 (2012)
Hulgan, J.: Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Math. 309, 2548–2550 (2009)
Karp, R.: Reducibility among combinatorial problems, complexity of computer computations. In: Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights. Plenum, New York, pp 85-103 (1972)
Pike, D., Zou, Y.: Decycling Cartesian products of two cycles. SIAM J. Discrete Math. 19, 651–663 (2005)
Wang, H.: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G)=3\). J. Comb. Optim. 14, 87–109 (2007)
Xuong, N.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B 26, 217–225 (1979)
Zhang, Z., Chen, X., Li, J., Yao, B., Lv, X., Wang, J.: On adjacent-vertex-distinguishing total coloring of graphs. Sci. China Ser. A 48, 289–299 (2005)
Acknowledgements
The authors would like to thank the anonymous referees for their valuable and constructive suggestions, which greatly improve the present paper. Supported by the National Natural Science Foundation of China under Grant Nos. 11171114, 11401576; Science and Technology Commission of Shanghai Municipality under Grant No. 13dz2260400
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yang, C., Ren, H. & Wei, E. A Note on Decycling Number, Vertex Partition and AVD-Total Coloring in Graphs. Graphs and Combinatorics 34, 1325–1332 (2018). https://doi.org/10.1007/s00373-018-1959-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-018-1959-8