Abstract
For any \(k\in {\mathbb {N}}\), the k-subdivision of graph G is a simple graph \(G^{\frac{1}{k}}\), which is constructed by replacing each edge of G with a path of length k. In (Iradmusa in Discrete Math 310(10–11):1551–1556, 2010), the mth power of the n-subdivision of G has been introduced as a fractional power of G, denoted by \(G^{\frac{m}{n}}\). Wang and Liu (Discrete Math Algorithms Appl 10(3):1850041, 2018) showed that \(\chi (G^{\frac{3}{3}})\le 7\) for any subcubic graph G. In this note, a short proof is given for this theorem by use of incidence chromatic number.
Similar content being viewed by others
References
Agnarsson G, Halldorsson MM (2000) Coloring powers of planar graphs. In: Proceedings on 11th Annual ACM-SIAM symposium on discrete algorithms, pp 654–662
Behzad M (1965) Raphs and their chromatic numbers. Ph.D. thesis, Michigan State University, Michigan
Bondy JA, Murty USR (2008) Graph theory, graduate texts in mathematics, vol 244. Springer, New York
Brualdi RA, Massey JQ (1993) Incidence and strong edge colorings of graphs. Discrete Math. 122:51–58
Iradmusa MN (2010) On colorings of graph fractional powers. Discrete Math. 310(10–11):1551–1556
Maydanskiy M (2005) The incidence coloring conjecture for graphs of maximum degree three. Discrete Math. 292:131–141
Vizing VG (1964) On an estimate of the chromatic class of a $p$-graph. Diskret. Analiz 3:25–30
Wang F, Liu X (2018) Coloring 3-power of 3-subdivision of subcubic graph. Discrete Math. Algorithms Appl 10(3):1850041
Acknowledgement
The author is grateful to the referees for suggestions which improved the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Iradmusa, M.N. A Short Proof of 7-Colorability of \(\frac{3}{3}\)-Power of Subcubic Graphs. Iran J Sci Technol Trans Sci 44, 225–226 (2020). https://doi.org/10.1007/s40995-020-00819-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40995-020-00819-1