Disjoint triangles of a cubic line graph

作者：Zhang, XD^*; Bylka, S

来源：Graphs and Combinatorics, 2004, 20(2): 275-280.

DOI：10.1007/s00373-004-0551-6

• cubic graph
• line graph
• triangle
• the acyclic chromatic number

In this paper, we prove that a cubic line graph G on n vertices rather than the complete graph K-4 has [n/3] vertex-disjoint triangles and the vertex independence number [n/3]. Moreover, the equitable chromatic number, acyclic chromatic number and bipartite density of G are 3, 3, 7/9 respectively.

• 出版日期2004-6
• 单位上海交通大学