✦ LIBER ✦

Markov bases of binary graph models of -minor free graphs

✍ Scribed by Daniel Král'; Serguei Norine; Ondřej Pangrác

Book ID: 108167287
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 178 KB
Volume: 117
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2009.07.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Markov Bases of Binary Graph Models

✍ Mike Develin; Seth Sullivant 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 309 KB

-labelling of -minor free graphs

✍ Wang Weifan; Wang Yiqiao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 113 KB

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

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.

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

Adjacent vertex-distinguishing edge colo

Adjacent vertex-distinguishing edge colorings of -minor free graphs

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 213 KB