Every planar graph with cycles of length neither 4 nor 5 is\((1,1,0)\)-colorable

✍ Scribed by Xu, Lingji; Miao, Zhengke; Wang, Yingqian

• Book ID: 120694241
• Publisher: Springer US
• Year: 2013
• Tongue: English
• Weight: 304 KB
• Volume: 28
• Category: Article
• ISSN: 1382-6905
• DOI: 10.1007/s10878-012-9586-4