✦ LIBER ✦

Coloring graphs with stable cutsets

✍ Scribed by Alan Tucker

Book ID: 107884176
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 537 KB
Volume: 34
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90039-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Color-critical graphs with independent c

Color-critical graphs with independent cutset

✍ S. M. Gyulumyan 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 581 KB

On stable cutsets in line graphs

✍ Van Bang Le; Bert Randerath 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 253 KB

We answer a question of Brandst adt et al. by showing that deciding whether a line graph with maximum degree 5 has a stable cutset is NP-complete. Conversely, the existence of a stable cutset in a line graph with maximum degree at most 4 can be decided e ciently. The proof of our NP-completeness res

Skewness of Graphs with Small Cutsets

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

Coloring planar Toeplitz graphs and the

Coloring planar Toeplitz graphs and the stable set polytope

✍ Reinhardt Euler 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Cliques and odd cycles are well known to induce facet-deÿning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the ÿrst part of this paper we generalize both notions to (Kn \ e)-cycles

Coloring Graphs with Sparse Neighborhood

Coloring Graphs with Sparse Neighborhoods

✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

It is shown that the chromatic number of any graph with maximum degree d in which the number of edges in the induced subgraph on the set of all neighbors of any vertex does not exceed d 2 Âf is at most O(dÂlog f ). This is tight (up to a constant factor) for all admissible values of d and f.

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