𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colorings of infinite graphs without one-colored rays

✍ Scribed by Norbert Polat

Book ID
102648176
Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
773 KB
Volume
22
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

The R-chromatic number of a graph G is the least number of subsets of vertices forming a partition of V ( G ) , and which induce subgraphs of G without infinite paths. For any integer n 2 2, we give sufficient conditions for a graph containing no subdivision of an infinite complete graph to have a R-chromatic number 5 n. 0

πŸ“œ SIMILAR VOLUMES

Colored graphs without colorful cycles
Colored graphs without colorful cycles
✍ Richard N. Ball; AleΕ‘ Pultr; Petr VojtΔ›chovskΓ½ πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 281 KB
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

Coloring Graphs without Short Non-boundi
Coloring Graphs without Short Non-bounding Cycles
✍ S. Fisk; B. Mohar πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 357 KB

It is shown that there is a constant \(c\) such that if \(G\) is a graph embedded in a surface of genus \(g\) (either orientable or non-orientable) and the length of a shortest non-bounding cycle of \(G\) is at least \(c \log (g+1)\), then \(G\) is six-colorable. A similar result holds for three- an