✦ LIBER ✦

Perfect and locally perfect colorings

✍ Scribed by Irena Rusu

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 655 KB
Volume: 20
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190200413

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We present a new algorithm for coloring perfect graphs and use it to color the parity orderable graphs, a class which strictly contains parity graphs. Also, we modify this algorithm to obtain an O(m^2^ + n) locally perfect coloring algorithm for parity graphs. © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

On locally-perfect colorings

✍ Pierre Duchet 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 272 KB

A coloring of a graph is locally-perfect if for every vertex u, the closed neighborhood of II contains no more than o(u) colors, where w(u) is the order of a largest clique containing u. Here is constructed, for any 4 2 3, a q + l-chromatic graph, with clique number Q, that admits a locally-perfect

Ecological and perfect colorings

✍ Stephen P. Borgatti; Martin G. Everett 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 839 KB

Locally perfect graphs

✍ Myriam Preissmann 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 983 KB

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

Uniquely colorable perfect graphs

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

On the two-edge-colorings of perfect gra

On the two-edge-colorings of perfect graphs

✍ Chính T. Hoàng 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. © 1995 Joh