✦ LIBER ✦

On locally-perfect colorings

✍ Scribed by Pierre Duchet

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 272 KB
Volume: 74
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90195-7

No coin nor oath required. For personal study only.

✦ Synopsis

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 coloring. This answers a problem of Preissmann [3].

📜 SIMILAR VOLUMES

Perfect and locally perfect colorings

✍ Irena Rusu 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

## 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 Wi

Ecological and perfect colorings

✍ Stephen P. Borgatti; Martin G. Everett 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 839 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

Extending colorings of locally planar gr

Extending colorings of locally planar graphs

✍ Michael O. Albertson; Joan P. Hutchinson 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g À 1). If P V(G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromati

Locally perfect graphs

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

Azumaya rings with locally perfect cente

Azumaya rings with locally perfect centers

✍ Douglas G Burkholder 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 728 KB