๐”– Bobbio Scriptorium
โœฆ   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

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.

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
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