✦ LIBER ✦

On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case

✍ Scribed by Celina M.H. De Figueiredo; Frédéric Maffray; Oscar Porto

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 220 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730170019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the sibling-structure of perfect grap

On the sibling-structure of perfect graphs

✍ C.T Hoàng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 253 KB

On the P4-structure of Perfect Graphs. I

On the P4-structure of Perfect Graphs. IV. Partner graphs

✍ Ryan B Hayward; William J Lenhart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 318 KB

On the choice number of claw-free perfec

On the choice number of claw-free perfect graphs

✍ Sylvain Gravier; Frédéric Maffray 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 273 KB

We prove that every 3-chromatic claw-free perfect graph is 3-choosable.

On the P4-structure of perfect graphs. I

On the P4-structure of perfect graphs. II. Odd decompositions

✍ C.T Hoang 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 897 KB

On the P4-structure of perfect graphs II

On the P4-structure of perfect graphs III. Partner decompositions

✍ V Chvátal 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 243 KB

On the asymptotic structure of sparse tr

On the asymptotic structure of sparse triangle free graphs

✍ Pr�mel, Hans J�rgen; Steger, Angelika 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB

An important result of Erdos, Kleitman, and Rothschild says that almost every triangle-free graph on n vertices has chromatic number 2. In this paper w e study the asymptotic structure of graphs in y0rb,,,(K3), i.e., in the class of trianglefree graphs on n vertices having rn = rn(n) edges. In parti