A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.
โฆ LIBER โฆ
On the strong chromatic index of cubic Halin graphs
โ Scribed by Ko-Wei Lih; Daphne Der-Fen Liu
- Book ID
- 113449377
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 362 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The strong chromatic index of complete c
โ
W.C. Shiu; W.K. Tam
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 809 KB
The strong chromatic index of Halin grap
โ
Hsin-Hao Lai; Ko-Wei Lih; Ping-Ying Tsai
๐
Article
๐
2012
๐
Elsevier Science
๐
English
โ 262 KB
On the complete chromatic number of Hali
โ
Zhongfu Zhang; Linzhong Liu
๐
Article
๐
1997
๐
Institute of Applied Mathematics, Chinese Academy
๐
English
โ 300 KB
Upper bounds on vertex distinguishing ch
โ
Jun-qiao Zhu, Yue-hua Bu
๐
Article
๐
2012
๐
SP Editorial Committee of Applied Mathematics - A
๐
English
โ 281 KB
Strong chromatic index of subset graphs
โ
Quinn, Jennifer J.; Benjamin, Arthur T.
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 115 KB
๐ 2 views
The strong chromatic index of a graph G, denoted sq(G), is the minimum number of parts needed to partition the edges of G into induced matchings. For 0 โค k โค l โค m, the subset graph S m (k, l) is a bipartite graph whose vertices are the kand l-subsets of an m element ground set where two vertices ar
The Strong Chromatic Index of Random Gra
โ
Frieze, Alan; Krivelevich, Michael; Sudakov, Benny
๐
Article
๐
2005
๐
Society for Industrial and Applied Mathematics
๐
English
โ 160 KB