𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring

✍ Scribed by Kang, Ross J.; Sereni, Jean-Sébastien; Stehlík, Matěj

Book ID
118197854
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
294 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-face coloring of plane graphs with
Edge-face coloring of plane graphs with maximum degree nine
✍ Jean-Sébastien Sereni; Matěj Stehlík 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3): [21][22][23][24][25][26][27][28][29][30][31][32][33] 1994] proved that every plane graph of max

Every 4-Colorable Graph With Maximum Deg
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
✍ H. A. Kierstead; A. V. Kostochka 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB

## Abstract Chen et al., conjectured that for __r__≥3, the only connected graphs with maximum degree at most __r__ that are not equitably __r__‐colorable are __K__~__r, r__~ (for odd __r__) and __K__~__r__ + 1~. If true, this would be a joint strengthening of the Hajnal–Szemerédi theorem and Brooks

An upper bound on the number of edges of
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
✍ Lian-ying Miao; Shi-you Pang; Jian-liang Wu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 100 KB

In this paper, we prove that any edge-coloring critical graph G with maximum degree ¿ (11 + √ 49 -24 )=2, where 6 1, has the size at least 3(|V (G)| -) + 1 if 6 7 or if ¿ 8 and |V (G)| ¿ 2 --4 -( + 6)=( -6), where is the minimum degree of G. It generalizes a result of Sanders and Zhao.