Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

JCT
2006

favoriteEmaildiscussreport

79views more JCT 2006»

A class of perfectly contractile graphs

13 years 10 months ago

A class of perfectly contractile graphs

Download www.liafa.jussieu.fr

We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between them). We prove that every graph G A different from a clique has an "even pair" (two vertices that are not joined by a chordless path of odd length), as conjectured by Everett and Reed [see the chapter "Even pairs" in the book Perfect Graphs, J.L. Ram

Frédéric Maffray, Nicolas Trotignon

Real-time Traffic

Disjoint Paths | Disjoint Triangles | JCT 2006 | Odd Hole |

claim paper

Related Content

» Coloring BullFree Perfectly Contractile Graphs

» Precoloring Extension of CoMeyniel Graphs

» Upper domination and upper irredundance perfect graphs

» On the Matching Problem for Special Graph Classes

» Parameterized Complexity of Vertex Deletion into Perfect Graph Classes

» Finding Independent Sets in Unions of Perfect Graphs

» tPerfection Is Always Strong for ClawFree Graphs

» A disproof of Hennings conjecture on irredundance perfect graphs

» On classes of minimal circularimperfect graphs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	Frédéric Maffray, Nicolas Trotignon

Comments (0)