✦ LIBER ✦

Infinite highly connected planar graphs of large girth

✍ Scribed by A. Georgakopoulos

Publisher: Vandenhoeck & Ruprecht
Year: 2006
Tongue: German
Weight: 463 KB
Volume: 76
Category: Article
ISSN: 0025-5858
DOI: 10.1007/bf02960866

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total Colourings of Planar Graphs with L

Total Colourings of Planar Graphs with Large Girth

✍ O.V. Borodin; A.V. Kostochka; D.R. Woodall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 96 KB

It is proved that if G is a planar graph with total (vertex-edge) chromatic number χ , maximum degree and girth g, then χ = + 1 if ≥ 5 and g ≥ 5, or ≥ 4 and g ≥ 6, or ≥ 3 and g ≥ 10. These results hold also for graphs in the projective plane, torus and Klein bottle.

(2 + ?)-Coloring of planar graphs with l

(2 + ?)-Coloring of planar graphs with large odd-girth

✍ Klostermeyer, William; Zhang, Cun Quan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 3 views

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f ( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f ( ), then G is (2 + )-colorable. N

n-Tuple Coloring of Planar Graphs with L

n-Tuple Coloring of Planar Graphs with Large Odd Girth

✍ William Klostermeyer; Cun Quan Zhang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 149 KB

On the girth of infinite graphs

✍ Norbert Seifter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Let X be an infinite k-valent graph with polynomial growth of degree d, i.e. there is an integer d and a constant c such that fx(n) 3, d> 1, 123, there exist k-valent connected graphs with polynomial growth of degree d and girth greater than 1. This means that in general the girth of graphs with pol

Colorings and girth of oriented planar g

Colorings and girth of oriented planar graphs

✍ Jarik Nešetřil; André Raspaud; Eric Sopena 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Extraconnectivity of graphs with large g

Extraconnectivity of graphs with large girth

✍ J. Fàbrega; M.A. Fiol 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB