𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perfect couples of graphs

✍ Scribed by János Körner; Gábor Simonyi; Zsolt Tuza

Book ID
105116912
Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
662 KB
Volume
12
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Cycle-perfect graphs are perfect
Cycle-perfect graphs are perfect
✍ Le, Van Bang 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB 👁 2 views

The cycle graph of a graph G is the edge intersection graph of the set of all the induced cycles of G. G is called cycle-perfect if G and its cycle graph have no chordless cycles of odd length at least five. We prove the statement of the title. 0 1996 John Wiley &

Cross-intersecting couples of graphs
Cross-intersecting couples of graphs
✍ Emanuela Fachini; János Körner 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Two graphs on the same vertex set form a cross‐intersecting couple if they have a pair of clique coverings with the property that every pair of cliques from the respective coverings intersect. In particular, a graph is called normal if it forms a cross‐intersecting couple with its compl

Locally perfect graphs
Locally perfect graphs
✍ Myriam Preissmann 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 983 KB
Bipartite-Perfect Graphs
Bipartite-Perfect Graphs
✍ Van Bang Le 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB