𝔖 Bobbio Scriptorium
✦   LIBER   ✦

-colouring outerplanar graphs with large girth

✍ Scribed by Frédéric Maffray; Ana Silva

Book ID
113567600
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
298 KB
Volume
312
Category
Article
ISSN
0012-365X

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.

UniquelyH-colorable graphs with large gi
UniquelyH-colorable graphs with large girth
✍ Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 2 views

Suppose G and H are graphs. We say G is H-colorable if there is a homomorphism (edge-preserving vertex mapping) from G to H. We say a graph G is uniquely H-colorable if there is an onto homomorphism c from G to H, and any other homomorphism from G to H is the composition o o c of c with an automorph

4-chromatic graphs with large odd girth
4-chromatic graphs with large odd girth
✍ Nguyen Van Ngoc; Zsolt Tuza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lov~sz. The proof presented here is elementary combinatorial.