✦ LIBER ✦

Locally perfect graphs

✍ Scribed by Myriam Preissmann

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 983 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90094-g

No coin nor oath required. For personal study only.

📜 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

A generalization of perfect graphs?i-per

A generalization of perfect graphs?i-perfect graphs

✍ Cai, Leizhen; Corneil, Derek 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 1003 KB

Let i be a positive integer. We generalize the chromatic number x ( G ) of G and the clique number w(G) of G as follows: The i-chromatic number of G , denoted by x Z ( G ) , is the least number k for which G has a vertex partition V,, V,, . . . , Vk: such that the clique number of the subgraph induc

Critical perfect graphs and perfect 3-ch

Critical perfect graphs and perfect 3-chromatic graphs

✍ Alan Tucker 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Locally Pancyclic Graphs

✍ Ladislav Stacho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 215 KB

We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and d G (x)+d G ( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C 3 ,

Locally petersen graphs

✍ J. I. Hall 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 684 KB

## Abstract A graph Γ is locally Petersen if, for each point __t__ of Γ, the graph induced by Γ on all points adjacent to __t__ is isomorphic to the Petersen graph. We prove that there are exactly three isomorphism classes of connected, locally Petersen graphs and further characterize these graphs

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