Papers available on-line

Perfect Graphs

The Strong Perfect Graph Theorem ( with N.Robertson, P.Seymour, R.Thomas), Annals of Math Vol 164(2006), 51-229 ( .pdf version )

Recognizing Berge Graphs ( with G.Cornuejols, X.Liu, P.Seymour, K. Vuskovic), Combinatorica Vol. 25(2005), 143-187 ( .pdf version )

Berge Trigraphs, Journal of Graph Theory Vol 53(2006), 1-55 ( .pdf version )

Even Pairs in Berge Graphs ( with P.Seymour), Journal of Combinatorial Theory. Ser B, Vol. 99 (2009), 300-377 ( .pdf version )

Three-colorable perfect graphs without even pairs ( with P.Seymour), submitted for publication ( .pdf version )


Claw-free Graphs

The Structure of Claw-free Graphs ( with Paul Seymour), Surveys in Combinatirics 2005, London Math Soc Lecture Note Series Vol. 327, 153-171 ( .pdf version )

The Roots of The Stable Set Polynomial of a Claw-free Graph ( with Paul Seymour), Journal of Combinatorial Theory. Ser B, Vol. 97 (2007), 350-357 ( .pdf version )

Claw-free Graphs I. Orientable prismatic graphs ( with Paul Seymour), Journal of Combinatorial Theory. Ser B, Vol. 97 (2007), 867-901 ( .pdf version )

Claw-free Graphs II. Non-orientable prismatic graphs ( with Paul Seymour), Journal of Combinatorial Theory. Ser B, Vol. 98 (2008), 249-290 ( .pdf version )

Claw-free Graphs III. Circular Interval Graphs ( with Paul Seymour), Journal of Combinatorial Theory. Ser B, Vol. 98 (2008), 812-834 ( .pdf version )

Claw-free Graphs IV. Decomposition theorem ( with Paul Seymour), Journal of Combinatorial Theory. Ser B, Vol. 98 (2008), 839-938 ( .pdf version )

Claw-free Graphs V. Global structure ( with Paul Seymour), Journal of Combinatorial Theory. Ser B, Vol. 98 (2008), 1373-1410 ( .pdf version )

Claw-free Graphs VI. Coloring claw-free graphs. ( with Paul Seymour), submitted for publication ( .pdf version )

Claw-free Graphs VII. Quasi-line graphs ( with Paul Seymour), submitted for publication ( .pdf version )

Coloring quasi-line graphs ( with Alexandra Ovetsky), Journal of Graph Theory Vol. 54(2007), 41-50 ( .pdf version )

Hadwiger's conjecture for quasi-line graphs ( with Alexandra Ovetsky Fradkin), Journal of Graph Theory 59 (2008), 17-33 ( .pdf version )

An approximate version of Hadwiger's conjecture for claw-free graphs ( with Alexandra Ovetsky Fradkin), to appear in the Journal of Grpah Theory ( .pdf version )


Bull-free Graphs

The structure of bull-free graphs I--- three-edge paths with centers and anticenters submitted for publication ( .pdf version )

The structure of bull-free graphs II--- elementary trigraphs submitted for publication ( .pdf version )

The structure of bull-free sraphs III--- global structure submitted for publication ( .pdf version )


Other papers on forbidden induced subgraphs

$K_4$-free graphs with no odd holes ( with N. Robertson, P.Seymour and R. Thomas), to appear in JCT B ( .pdf version )

Excluding induced subgraphs ( with Paul Seymour), Surveys in Combinatirics 2007, London Math Soc Lecture Note Series Vol. 346, 99-119 ( .pdf version )

Bisimplicial vertices in even-hole-free graphs ( with L. Addario-Berry, F. Havet, B. Reed and P. Seymour), Journal of Combinatorial Theory. Ser B, Vol. 98 (2008), 1119-1164 ( .pdf version )

Solution of three problems of Cornuejols ( with Paul Seymour), Journal of Combinatorial Theory. Ser B, Vol. 98 (2008), 116-135 ( .pdf version )
Algorithms for detecting induced subgraphs

Detecting Even Holes ( with K. Kawarabayashi and P. Seymour), Journal of Graph Theory Vol. 48(2005), 85-111 ( .pdf version )

The three-in-a-tree problem ( with Paul Seymour), to appear in Combinatorica ( .pdf version )

Detecting a theta or a prism ( with Rohan Kapadia), SIAM Journal on Discrete Math 22(2008), 1164-1186 ( .pdf version )
A paper related to the Caccetta-Haggkvist Conjecture

Cycles in dense digraphs ( with Paul Seymour and Blair Sullivan), Combinatorica 28(2008), 1-18 ( .pdf version )
The Erdos-Hajnal Conjecture

Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement ( with Yori Zwols), submitted for publication .pdf version

The Erdos-Hajnal Conjecture for bull-free graphs ( with Shmuel Safra), Journal of Combinatorial Theory. Ser B, 98 (2008), 1301-1310 ( .pdf version )
Tournaments and Rao's Conjecture

A well-quasi-order for tournaments ( with Paul Seymour), submitted for publication ( .pdf version )
Other

Analyzing the performance of greedy maximal scheduling via local pooling and graph theory (conference version) ( with Berk Birand, Paul Seymour, Bernard Ries, Gil Zussman and Yori Zwols, ( submitted for publication )

Packing seagulls ( with Paul Seymour), submitted for publication ( .pdf version )

Finding minimum clique capacity ( with Sang-il Oum and Paul Seymour), submitted for publication ( .pdf version )

The edge density for K_{2,t} minors ( with Bruce Reed and Paul Seymour), submitted for publication ( .pdf version )

Perfect matchings in planar cubic graphs ( with Paul Seymour), to appear in Combinatorica ( .pdf version )

Non-zero A-paths in graphs with edges labeled by group elements ( with Jim Geelen, Bert Gerards, Luis Goddyn, Michael Lohman, and Paul Seymour), Combinatorica Vol. 26(2006), 521-532 ( .pdf version )

An algorithm for packing non-zero $A$-paths in group-labeled graphs ( with William H. Cunningham and Jim Geelen), Combinatorica 28(2008), 145-161 ( .pdf version )

Partial characterizations of clique-perfect graphs I : claw-free graphs ( with Flavia Bonomo and Guillermo Duran), Discrete Applied Mathematics 156 (2008), 1058-1082 ( .pdf version )

Partial characterizations of clique-perfect graphs II : diamond-free and Helly circular-arc graphs ( with Flavia Bonomo and Guillermo Duran), to appear in Discrete Mathematics ( .pdf version )