A. Sassano, Chair-free Berge graphs are perfect, Graphs Combin. 13(4) (1997), 369-391. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Minimal Imperfect Graphs without Induced P 5 - Barre, Fouquet (1999) (Correct)
....a 2K 2 and therefore that SPGC is true for 2K 2 free graphs. First note that SPGC is already known to hold for several classes of F free graphs : when F is a bull (an F 13 ) see Chv atal and Sbihi [10] a dart (an F 9 ) see Sun [35] a chair (an H 1 ) and a co chair (an F 10 ) see Sassano [31]. Moreover SPGC is also known to hold for certain classes of (P 5 ; F ) free graphs : when F is an F 5 , an F 6 , or a P 5 this follows from a result due to Hayward [16] on Murky graphs (i.e. on graphs that contain no C 5 , no P 6 and no P 6 ) when F is an F 12 this follows from a result due to ....
....[25] Ho ang [17] A Berge graph is perfect if it contains no P 5 and no H 1 . Theorem 19 Let G be a Berge graph with no P 5 and no F 10 (i.e. no anti chair) then G is perfect. In fact, these two results are corollaries of the following more general theorem due to Sassano, Theorem 20 (Sassano [31]) Chair free Berge graphs are perfect. Applying the same technique as in Ho ang [17] we obtain Theorem 21 A Berge graph is perfect if it contains no P 5 and no F 12 . One can remark that this result can be derived from a Theorem due to Olariu; indeed, it is easy to see that a (P 5 ; F 12 ....
A. Sassano, Chair-free Berge graphs are Perfect, Graphs and Combin. 13 (4) (1997) 369-395.
Vertex Colouring and Forbidden Subgraphs - a Survey - Randerath, Schiermeyer (2003) (Correct)
No context found.
A. Sassano, Chair-free Berge graphs are perfect, Graphs Combin. 13(4) (1997), 369-391.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC