𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equitable colorings of planar graphs without short cycles

✍ Scribed by Nakprasit, Keaitsuda; Nakprasit, Kittikorn

Book ID
119375416
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
241 KB
Volume
465
Category
Article
ISSN
0304-3975

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

Vertex colorings of graphs without short
Vertex colorings of graphs without short odd cycles
✍ Andrzej Dudek; Reshma Ramadurai πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

Motivated by the work of NeΕ‘etΕ™il and R ΓΆdl on "Partitions of vertices" we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and ord