✦ LIBER ✦

Trivially perfect graphs

✍ Scribed by Martin Charles Golumbic

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 222 KB
Volume: 24
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90178-4

No coin nor oath required. For personal study only.

✦ Synopsis

An undirected graph i!. rriuially pcrfc~ if for cbzry induced s&graph the stability numbt~r equal; the number of (maximal) cliques. We 1 haracterize the trivialI> perfect graphs a\ a pr0pt.r subclass of the triangulated graphs (thus dis2roving a claim of Buneman 13]1. and we rclart> them to some n :'I-known classes of perfect graphs.

📜 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

Critical perfect graphs and perfect 3-ch

Critical perfect graphs and perfect 3-chromatic graphs

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

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 &

Circular perfect graphs

✍ Xuding Zhu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB

For 1 d k, let K k=d be the graph with vertices 0; 1; . . . ; k À 1, in which i $ j if d ji À jj k À d. The circular chromatic number c ðGÞ of a graph G is the minimum of those k=d for which G admits a homomorphism to K k=d . The circular clique number ! c ðGÞ of G is the maximum of those k=d for wh

β-Perfect Graphs

✍ S.E. Markossian; G.S. Gasparian; B.A. Reed 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 291 KB

The class of ;-perfect graphs is introduced. We draw a number of parallels between these graphs and perfect graphs. We also introduce some special classes of ;-perfect graphs. Finally, we show that the greedy algorithm can be used to colour a graph G with no even chordless cycles using at most 2(/(G

Perfect product graphs

✍ G. Ravindra; K.R. Parthasarathy 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 880 KB

in this paper perfectness of varicws products of graphs is considered. The Cartesmn pro&r+. I G, x G, is perfect iff it has no induced C,,, , B (n 3 2). BJ considering the various uufik~cn~ conditions for the latter condition. perfect Carresisn products are charactcrixd. Similarly prrfcct tenwr prod