𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Short proofs of coloring theorems on planar graphs

✍ Scribed by Borodin, Oleg V.; Kostochka, Alexandr V.; Lidický, Bernard; Yancey, Matthew

Book ID
121694975
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
373 KB
Volume
36
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Easier proofs of coloring theorems
Easier proofs of coloring theorems
✍ Jan van Mill 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 90 KB

We present a simpler proof of the known theorem that a fixed-point free homeomorphism on an n-dimensional paracompact space can be colored with n + 3 colors.

A short proof of a theorem on Hamiltonia
A short proof of a theorem on Hamiltonian graphs
✍ Ainouche, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

Coloring Powers of Planar Graphs
Coloring Powers of Planar Graphs
✍ Agnarsson, Geir; Halldórsson, Magnús M. 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 183 KB
Additive Coloring of Planar Graphs
Additive Coloring of Planar Graphs
✍ Tomasz Bartnicki, Bartłomiej Bosek, Sebastian Czerwiński… 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 202 KB
Short proofs of classical theorems
Short proofs of classical theorems
✍ J. A. Bondy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

## Abstract We give proofs of Ore's theorem on Hamilton circuits, Brooks' theorem on vertex coloring, and Vizing's theorem on edge coloring, as well as the Chvátal‐Lovász theorem on semi‐kernels, a theorem of Lu on spanning arborescences of tournaments, and a theorem of Gutin on diameters of orient