✦ LIBER ✦

Every toroidal graph is acyclically 8-choosable

✍ Scribed by Hou, Jian Feng; Liu, Gui Zhen

Book ID: 125352507
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2013
Tongue: English
Weight: 327 KB
Volume: 30
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-013-1497-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Every 2-choosable graph is (2m, m)-choos

Every 2-choosable graph is (2m, m)-choosable

✍ Tuza, Zs.; Voigt, M. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 449 KB

A graph G = (V, E ) with vertex set V and edge set E is called (a, b)-choosable ( a 2 2b) if for any collection {L(w)lv E V} of sets L ( v ) of cardinality a there exists a collection Giving a partial solution to a problem raised by Erdos, Rubin, and Taylor in 1979, we prove that every (2. 1)-choos

Every Planar Graph Is 5-Choosable

✍ C. Thomassen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 56 KB

We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdös, A. L. Rubin, and H. Taylor. (i) 1994 Academic Press, Inc.

Every 3-connected claw-free Z8-free grap

Every 3-connected claw-free Z8-free graph is Hamiltonian

✍ Hong-Jian Lai; Liming Xiong; Huiya Yan; Jin Yan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

## Abstract In this article, we first show that every 3‐edge‐connected graph with circumference at most 8 is supereulerian, which is then applied to show that a 3‐connected claw‐free graph without __Z__~8~ as an induced subgraph is Hamiltonian, where __Z__~8~ denotes the graph derived from identify