Abstract.
In this paper, we prove that a cubic line graph G on n vertices rather than the complete graph K
4 has 
vertex-disjoint triangles and the vertex independence number . Moreover, the equitable chromatic number, acyclic chromatic number and bipartite density of G are 
respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Acknowledgments The authors are grateful to the referees for valuable suggestions and comments which results in a great improvement of the original manuscript.
Final version received: December 5, 2003
Supported by National Natural Science Foundation of China (No: 10371075) and the Project-sponsored by SRF for ROCS, SEM
Rights and permissions
About this article
Cite this article
Zhang, XD., Bylka, S. Disjoint Triangles of a Cubic Line Graph. Graphs and Combinatorics 20, 275–280 (2004). https://doi.org/10.1007/s00373-004-0551-6
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-004-0551-6