๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The strong chromatic index of Halin graphs

โœ Scribed by Hsin-Hao Lai; Ko-Wei Lih; Ping-Ying Tsai

Book ID
113567451
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
262 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The strong chromatic index of complete c
The strong chromatic index of complete cubic Halin graphs
โœ 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.

Edge-face chromatic number of Halin-grap
Edge-face chromatic number of Halin-graphs
โœ Zhongfu Zhang; Xinzhong Lu; Linzhong Liu; Jianfang Wang; Tongxin Gu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer ๐ŸŒ English โš– 50 KB
Strong chromatic index of subset graphs
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

On the complete chromatic number of Hali
On the complete chromatic number of Halin graphs
โœ Zhongfu Zhang; Linzhong Liu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 300 KB
The Strong Chromatic Index of Random Gra
The Strong Chromatic Index of Random Graphs
โœ Frieze, Alan; Krivelevich, Michael; Sudakov, Benny ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 160 KB