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

Strong Chromatic Index of 2-Degenerate Graphs

โœ Scribed by Gerard Jennhwa Chang; N. Narayanan


Book ID
112121113
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
508 KB
Volume
73
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Game chromatic index of k-degenerate gra
โœ Leizhen Cai; Xuding Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB ๐Ÿ‘ 1 views
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 Halin grap
โœ Hsin-Hao Lai; Ko-Wei Lih; Ping-Ying Tsai ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 262 KB
The Strong Chromatic Index of Random Gra
โœ Frieze, Alan; Krivelevich, Michael; Sudakov, Benny ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 160 KB