✦ LIBER ✦

Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable

✍ Scribed by Yingqian Wang; Xianghua Mao; Zhengke Miao

Book ID: 112121137
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 567 KB
Volume: 73
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21676

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar graphs with maximum degree 7 and

Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

✍ Lan Shen; Yingqian Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Planar graphs with maximum degree 8 and

Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

✍ JianSheng Cai, GuangHui Wang, GuiYing Yan 📂 Article 📅 2012 🏛 SP Science China Press 🌐 English ⚖ 463 KB

Very rapidly mixing Markov chains for 2Δ

Very rapidly mixing Markov chains for 2Δ-colorings and for independent sets in a graph with maximum degree 4

✍ Michael Molloy 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 1 views

We introduce a new technique for analyzing the mixing rate of Markov chains. We use it to prove that the Glauber dynamics on 2 -colorings of a graph with maximum degree mixes in O n log n time. We prove the same mixing rate for the Insert/Delete/Drag chain of Dyer and Greenhill (Random Structures A