𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Total colorings of planar graphs without intersecting 5-cycles

✍ Scribed by Bing Wang; Jian-Liang Wu


Book ID
113564826
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
312 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Planar graph colorings without short mon
✍ 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