✦ LIBER ✦

-labelling of -minor free graphs

✍ Scribed by Wang Weifan; Wang Yiqiao

Book ID: 108153458
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 113 KB
Volume: 98
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.02.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Choosability of K5-minor-free graphs

✍ Riste Sˇkrekovski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all Ks-minor-free graphs are 5-choosable. (~) 1998 Elsevier Science B.V.

Strong-Diameter Decompositions of Minor

Strong-Diameter Decompositions of Minor Free Graphs

✍ Ittai Abraham; Cyril Gavoille; Dahlia Malkhi; Udi Wieder 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 638 KB

Vertex Partitions of K4,4-Minor Free Gra

Vertex Partitions of K4,4-Minor Free Graphs

✍ Leif K. Jørgensen 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 121 KB

Clique minors in claw-free graphs

✍ Alexandra Fradkin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Complete Minors InKs,s-Free Graphs

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 262 KB

Markov bases of binary graph models of -

Markov bases of binary graph models of -minor free graphs

✍ Daniel Král'; Serguei Norine; Ondřej Pangrác 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 178 KB