Disjoint Triangles of a Cubic Line Graph

Xiao-Dong Zhang, Stanislaw Bylka
2004 Graphs and Combinatorics  
In this paper, we prove that a cubic line graph G on n vertices rather than the complete graph K 4 has b n 3 c vertex-disjoint triangles and the vertex independence number b n 3 c. Moreover, the equitable chromatic number, acyclic chromatic number and bipartite density of G are 3, 3, 7 9 respectively.
doi:10.1007/s00373-004-0551-6 fatcat:iwostnemgfdcjhe35jb7qv4j2u