✦ LIBER ✦

Reverse Mathematics and Grundy colorings of graphs

✍ Scribed by James H. Schmerl

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 137 KB
Volume: 56
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.200910108

No coin nor oath required. For personal study only.

✦ Synopsis

The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investigated.

📜 SIMILAR VOLUMES

Graph Coloring and Reverse Mathematics

✍ James H. Schmerl 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

Reverse mathematics and infinite traceab

Reverse mathematics and infinite traceable graphs

✍ Peter Cholak; David Galvin; Reed Solomon 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

## 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

Oriented list colorings of graphs

✍ Zs. Tuza; M. Voigt 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 1 views

A 2-assignment on a graph G (V,E) is a collection of pairs Lv of allowed colors speci®ed for all vertices v PV. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satis®es the following property: For every 2-assignment there exists a choic

Acrylic improper colorings of graphs

✍ Boiron, P.; Sopena, E.; Vignal, L. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

In this article, we introduce the new notion of acyclic improper colorings of graphs. An improper coloring of a graph is a vertex-coloring in which adjacent vertices are allowed to have the same color, but each color class V i satisfies some condition depending on i. Such a coloring is acyclic if th

Acyclic edge colorings of graphs

✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_

Face colorings of embedded graphs

✍ Dan Archdeacon 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB

We characterize those graphs which have at least one embedding into some surface such that the faces can be properly colored in four or fewer colors. Embeddings into both orientable and nonorientable surfaces are considered.