𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 3-colorability of planar graphs without adjacent short cycles

✍ Scribed by YingQian Wang; XiangHua Mao; HuaJing Lu; WeiFan Wang

Book ID
107348170
Publisher
SP Science China Press
Year
2010
Tongue
English
Weight
141 KB
Volume
53
Category
Article
ISSN
1674-7283

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

Acyclic 5-choosability of planar graphs
Acyclic 5-choosability of planar graphs without adjacent short cycles
✍ O. V. Borodin; A. O. Ivanova πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 93 KB πŸ‘ 1 views

The conjecture on acyclic 5-choosability of planar graphs [Borodin et al., 2002] as yet has been verified only for several restricted classes of graphs. None of these classes allows 4-cycles. We prove that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cy