𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Total Coloring of Planar Graphs Without Chordal Short Cycles

✍ Scribed by Wang, Huijuan; Liu, Bin; Wu, Jianliang

Book ID
125345652
Publisher
Springer Japan
Year
2014
Tongue
English
Weight
235 KB
Volume
31
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Planar graph colorings without short mon
Planar graph colorings without short monochromatic cycles
✍ TomΓ‘Ε‘ Kaiser; Riste Ε krekovski πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

## Abstract It is well known that every planar graph __G__ is 2‐colorable in such a way that no 3‐cycle of __G__ is monochromatic. In this paper, we prove that __G__ has a 2‐coloring such that no cycle of length 3 or 4 is monochromatic. The complete graph __K__~5~ does not admit such a coloring. On