✦ LIBER ✦

Color-critical graphs with independent cutset

✍ Scribed by S. M. Gyulumyan

Book ID: 105058710
Publisher: Springer US
Year: 1987
Tongue: English
Weight: 581 KB
Volume: 23
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071769

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring graphs with stable cutsets

✍ Alan Tucker 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Coloring plane graphs with independent c

Coloring plane graphs with independent crossings

✍ Daniel Král'; Ladislav Stacho 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

## Abstract We show that every plane graph with maximum face size four in which all faces of size four are vertex‐disjoint is cyclically 5‐colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5‐colorable. © 2009 Wiley Periodicals, Inc.

On color critical graphs

✍ Vojtech Rödl; Zsolt Tuza 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 555 KB

On graphs with strongly independent colo

On graphs with strongly independent color-classes

✍ A. Gyárfás; T. Jensen; M. Stiebitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract We prove that for every __k__ there is a __k__‐chromatic graph with a __k__‐coloring where the neighbors of each color‐class form an independent set. This answers a question raised by N. J. A. Harvey and U. S. R. Murty [4]. In fact we find the smallest graph __G__~__k__~ with the requir

Kernels in graphs with a clique-cutset

✍ Henry Jacob 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 138 KB

We consider graphs that have a clique-cutset, and we show that this property preserves the existence of a kernel in a certain sense. We consider finite directed graphs that do not have multiple arcs or loops, but there may be symmetric arcs between some pairs of vertices. Let G = (V, A) be a direct

Skewness of Graphs with Small Cutsets

✍ Graham Farr; Peter Eades 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 169 KB