𝔖 Bobbio Scriptorium
✦   LIBER   ✦

COLORING SUBGRAPHS OF THE RADO GRAPH

✍ Scribed by N. W. Sauer*

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
300 KB
Volume
26
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subgraph-avoiding coloring of graphs
Subgraph-avoiding coloring of graphs
✍ Jia Shen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract Given a “forbidden graph” __F__ and an integer __k__, an __F‐avoiding k‐coloring__ of a graph __G__ is a __k__‐coloring of the vertices of __G__ such that no maximal __F__‐free subgraph of __G__ is monochromatic. The __F‐avoiding chromatic number__ __ac__~__F__~(__G__) is the smallest i

On complete subgraphs of color-critical
On complete subgraphs of color-critical graphs
✍ Xiang-Ying Su 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A graph G is called k-critical if x(G) = k and x(G -e) -C x(G) for each edge e of G, where x denotes the chromatic number. T. Gallai conjectured that every k-critical graph of order n contains at most n complete (kl)-subgraphs. In 1987, Stiebitz proved Gallai's conjecture in the case k = 4, and in 1

Maximum Δ-edge-colorable subgraphs of cl
Maximum Δ-edge-colorable subgraphs of class II graphs
✍ Vahan V. Mkrtchyan; Eckhard Steffen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

## Abstract A graph __G__ is class II, if its chromatic index is at least Δ + 1. Let __H__ be a maximum Δ‐edge‐colorable subgraph of __G__. The paper proves best possible lower bounds for |__E__(__H__)|/|__E__(__G__)|, and structural properties of maximum Δ‐edge‐colorable subgraphs. It is shown tha

Partitions of large Rado graphs
Partitions of large Rado graphs
✍ M. Džamonja; J. A. Larson; W. J. Mitchell 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 377 KB