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

Acyclic chromatic indices of planar graphs with large girth

โœ Scribed by Weifan Wang; Qiaojun Shu; Kan Wang; Ping Wang


Book ID
108112931
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
446 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


4-chromatic graphs with large odd girth
โœ Nguyen Van Ngoc; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lov~sz. The proof presented here is elementary combinatorial.