✦ LIBER ✦

Girths of bipartite sextet graphs

✍ Scribed by Alfred Weiss

Book ID: 110564274
Publisher: Springer-Verlag
Year: 1984
Tongue: English
Weight: 198 KB
Volume: 4
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579225

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal non-bipartite regular graphs of

Extremal non-bipartite regular graphs of girth 4

✍ Zhao Dong-fang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 95 KB

The girth of a 4-homogeneous bipartite g

The girth of a 4-homogeneous bipartite graph

✍ Kaishun Wang 📂 Article 📅 2003 🏛 SP Science China Press 🌐 English ⚖ 106 KB

Extremal non-bipartite regular graphs of

Extremal non-bipartite regular graphs of girth 4

✍ Douglas Bauer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Constructions of small regular bipartite

Constructions of small regular bipartite graphs of girth 6

✍ G. Araujo-Pardo; Camino Balbuena 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

The Size of Bipartite Graphs with a Give

The Size of Bipartite Graphs with a Given Girth

✍ Shlomo Hoory 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 90 KB

High-Girth Graphs Avoiding a Minor are N

High-Girth Graphs Avoiding a Minor are Nearly Bipartite

✍ Anna Galluccio; Luis A. Goddyn; Pavol Hell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Let H be a fixed graph. We show that any H-minor free graph G of high enough girth has circular chromatic number arbitrarily close to two. Equivalently, each such graph G admits a homomorphism to a large odd circuit. In particular, graphs of high girth and of bounded genus, or of bounded tree width,