𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring perfect (K4 − e)-free graphs

✍ Scribed by Alan Tucker

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
349 KB
Volume
42
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring graphs with no odd-K4
Coloring graphs with no odd-K4
✍ Wenan Zang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 350 KB

The purpose of this note is to present a polynomial-time algorithm which, given an arbitrary graph G as its input, finds either a proper 3-coloring of G or an odd-K4 that is a subgraph of G in time O(mn), where m and n stand for the number of edges and the number of vertices of G, respectively. (~

Coloring precolored perfect graphs
Coloring precolored perfect graphs
✍ Kratochv�l, Jan; Seb?, Andr�s 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

We consider the question of the computational complexity of coloring perfect graphs with some precolored vertices. It is well known that a perfect graph can be colored optimally in polynomial time. Our results give a sharp border between the polynomial and NP-complete instances, when precolored vert

Perfect coloring and linearly χ-bound P6
Perfect coloring and linearly χ-bound P6-free graphs
✍ S. A. Choudum; T. Karthick; M. A. Shalu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract We derive decomposition theorems for __P__~6~, __K__~1~ + __P__~4~‐free graphs, __P__~5~, __K__~1~ + __P__~4~‐free graphs and __P__~5~, __K__~1~ + __C__~4~‐free graphs, and deduce linear χ‐binding functions for these classes of graphs (here, __P__~__n__~ (__C__~__n__~) denotes the path