𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a geometric property of perfect graphs

✍ Scribed by L. S. Zaremba; S. Perz

Book ID
110564475
Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
129 KB
Volume
2
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

A note on perfect graphs
A note on perfect graphs
✍ K. Cameron; J. Edmonds; L. LovΓ‘sz πŸ“‚ Article πŸ“… 1986 πŸ› Springer Netherlands 🌐 English βš– 164 KB
A connection between a convex programmin
A connection between a convex programming problem and the LYM property on perfect graphs
✍ Victor K. Wei πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 772 KB

We derive three equivalent conditions on a perfect graph concerning the optimal solution of a convex programming problem, the length-width inequality, and the simultaneous vertex covering by cliques and anticliques. By combining proof techniques including Lagrangian dual, Dilworth's Theorem, and Kuh