The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investigated.
Graph Coloring and Reverse Mathematics
β Scribed by James H. Schmerl
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 133 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We analyze three applications of Ramseyβs Theorem for 4βtuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramseyβs Theorem while the application in lattice t
## Abstract We introduce the (__a,b__)βcoloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and on-line computing. We present a randomized on-line Ε½ . coloring algorithm with a performance ratio of O nrlog n , an improvement of log n factor over the previous best known algorithm of Vishwanathan