✦ LIBER ✦

Perfection, Imperfection, and Graph Entropy

✍ Scribed by Gábor Simonyi

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 169 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80185-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Entropy splitting for antiblocking corne

Entropy splitting for antiblocking corners and perfect graphs

✍ I. Csiszár; J. Körner; L. Lovász; K. Marton; G. Simonyi 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 716 KB

Critical perfect graphs and perfect 3-ch

Critical perfect graphs and perfect 3-chromatic graphs

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

Algorithmic graph theory and perfect gra

Algorithmic graph theory and perfect graphs

✍ Rolf H. Möhring 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 81 KB

Perfect Graphs, Partitionable Graphs and

Perfect Graphs, Partitionable Graphs and Cutsets

✍ Michele Conforti; Gérard Cornuéjols; Grigor Gasparyan; Kristina Vušković 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 247 KB

Reconstructibility and perfect graphs

✍ Michael Von Rimscha 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 738 KB

It is shown that the following classes of graphs are recognizable (i.e. looking at the point-deleted subgraphs of a graph G one can decide whether G belongs to that class or not): (1) perfect graphs, (2) triangulated graphs, (3) interval graphs, (4) comparability graphs, (5) split graphs. Furthermor

Wings and perfect graphs

✍ Stephen Olariu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 999 KB

An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y and edges uv, vx, xy. The wing-graph W(G) of a graph G is a graph having the same vertex set as G; uv is an edge in W(G) if and only if uv is a wing in and some vertex in C is adjacent to all the rema