Paul D. Seymour

286 papers A* 9Journal 264Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Dense minors of graphs with independence number two. J. Comb. Theory B Sergey Norin, Paul D. Seymour
2026	J	`jnl`	Distant Digraph Domination. Electron. J. Comb. Tung Nguyen, Alexander Scott, Paul D. Seymour
2025	J	`jnl`	A counterexample to the coarse Menger conjecture. J. Comb. Theory B Tung Nguyen, Alex D. Scott, Paul D. Seymour
2025	J	`jnl`	Graphs without a 3-Connected Subgraph are 4-Colourable. Electron. J. Comb. Édouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott, Paul D. Seymour, Stéphan Thomassé, Nicolas Trotignon
2025	J	`jnl`	Induced subgraph density. II. Sparse and dense sets in cographs. Eur. J. Comb. Jacob Fox, Tung Nguyen, Alex D. Scott, Paul D. Seymour
2025	J	`jnl`	Some results and problems on tournament structure. J. Comb. Theory B Tung Nguyen, Alex Scott, Paul D. Seymour
2025	J	`jnl`	Subdivisions and near-linear stable sets. Comb. Tung Nguyen, Alex Scott, Paul D. Seymour
2025	J	`jnl`	Trees and near-linear stable sets. Comb. Tung Nguyen, Alex Scott, Paul D. Seymour
2025	J	`jnl`	When all directed cycles have length three. Eur. J. Comb. Paul D. Seymour
2024	J	`jnl`	A Note on the Gyárfás-Sumner Conjecture. Graphs Comb. Tung Nguyen, Alex Scott, Paul D. Seymour
2024	J	`jnl`	Bipartite graphs with no J. Comb. Theory B Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2024	J	`jnl`	Bounded-Diameter Tree-Decompositions. Comb. Eli Berger, Paul D. Seymour
2024	J	`jnl`	Clique covers of H-free graphs. Eur. J. Comb. Tung Nguyen, Alexander Scott, Paul D. Seymour, Stéphan Thomassé
2024	J	`jnl`	Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs. SIAM J. Discret. Math. Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte
2024	J	`jnl`	Graphs with all holes the same length. J. Comb. Theory B Linda Cook, Jake Horsfield, Myriam Preissmann, Cléophée Robin, Paul D. Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vuskovic
2024	J	`jnl`	Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2024	J	`jnl`	Induced paths in graphs without anticomplete cycles. J. Comb. Theory B Tung Nguyen, Alex D. Scott, Paul D. Seymour
2024	J	`jnl`	On a problem of El-Zahar and Erdős. J. Comb. Theory B Tung Nguyen, Alex D. Scott, Paul D. Seymour
2024	J	`jnl`	Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph. J. Graph Theory Tung Nguyen, Alex Scott, Paul D. Seymour
2024	J	`jnl`	Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph. J. Comb. Theory B Alex D. Scott, Paul D. Seymour
2024	J	`jnl`	Pure Pairs. IX. Transversal Trees. SIAM J. Discret. Math. Alex D. Scott, Paul D. Seymour, Sophie Theresa Spirkl
2024	J	`jnl`	Pure Pairs. VIII. Excluding a Sparse Graph. Comb. Alex Scott, Paul D. Seymour, Sophie Spirkl
2024	J	`jnl`	Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. Eur. J. Comb. Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Cops and robbers on P CoRR Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte
2023	J	`jnl`	Even-hole-free graphs still have bisimplicial vertices. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2023	J	`jnl`	Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. Comb. Alex Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Polynomial bounds for chromatic number VI. Adding a four-vertex path. Eur. J. Comb. Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Polynomial bounds for chromatic number VII. Disjoint holes. J. Graph Theory Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. J. Graph Theory Alexander D. Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Proof of a conjecture of Plummer and Zha. J. Graph Theory Maria Chudnovsky, Paul D. Seymour
2023	J	`jnl`	Pure Pairs. V. Excluding Some Long Subdivision. Comb. Alex Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Pure pairs. IV. Trees in bipartite graphs. J. Comb. Theory B Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix. J. Comb. Theory B Alex Scott, Paul D. Seymour, Sophie Spirkl
2023	J	`jnl`	Strengthening Rödl's theorem. J. Comb. Theory B Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2022	J	`jnl`	Concatenating Bipartite Graphs. Electron. J. Comb. Maria Chudnovsky, Patrick Hompe, Alex Scott, Paul D. Seymour, Sophie Spirkl
2022	J	`jnl`	Detecting a long even hole. Eur. J. Comb. Linda Cook, Paul D. Seymour
2022	J	`jnl`	Polynomial bounds for chromatic number II: Excluding a star-forest. J. Graph Theory Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2022	J	`jnl`	Polynomial bounds for chromatic number. III. Excluding a double star. J. Graph Theory Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2022	J	`jnl`	Pure Pairs VI: Excluding an Ordered Tree. SIAM J. Discret. Math. Alex Scott, Paul D. Seymour, Sophie Spirkl
2021	J	`jnl`	A note on simplicial cliques. Discret. Math. Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl
2021	J	`jnl`	Detecting a Long Odd Hole. Comb. Maria Chudnovsky, Alex Scott, Paul D. Seymour
2021	J	`jnl`	Erdős-Hajnal for cap-free graphs. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2021	J	`jnl`	Finding a Shortest Odd Hole. ACM Trans. Algorithms Maria Chudnovsky, Alex Scott, Paul D. Seymour
2021	J	`jnl`	Finding an induced path that is not a shortest path. Discret. Math. Eli Berger, Paul D. Seymour, Sophie Spirkl
2021	A*	`conf`	Induced subgraphs of bounded treewidth and the container method. SODA Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2021	J	`jnl`	Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. J. Comb. Theory B Maria Chudnovsky, Alex Scott, Paul D. Seymour
2021	J	`jnl`	New examples of minimal non-strongly-perfect graphs. Discret. Math. Maria Chudnovsky, Cemil Dibek, Paul D. Seymour
2021	J	`jnl`	Pure Pairs. II. Excluding All Subdivisions of A Graph. Comb. Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2020	J	`jnl`	A survey of χ-boundedness. J. Graph Theory Alex Scott, Paul D. Seymour
2020	J	`jnl`	Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory B Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour
2020	J	`jnl`	Detecting an Odd Hole. J. ACM Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl
2020	J	`jnl`	Excluding the fork and antifork. Discret. Math. Maria Chudnovsky, Linda Cook, Paul D. Seymour
2020	J	`jnl`	Induced subgraphs of bounded treewidth and the container method. CoRR Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour
2020	J	`jnl`	Induced subgraphs of graphs with large chromatic number. VI. Banana trees. J. Comb. Theory B Alex Scott, Paul D. Seymour
2020	J	`jnl`	Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture. J. Comb. Theory B Alex Scott, Paul D. Seymour
2020	J	`jnl`	Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. J. Comb. Theory, Ser. B Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl
2020	J	`jnl`	Induced subgraphs of graphs with large chromatic number. XIII. New brooms. Eur. J. Comb. Alex Scott, Paul D. Seymour
2020	J	`jnl`	Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl
2020	J	`jnl`	Short Directed Cycles in Bipartite Digraphs. Comb. Paul D. Seymour, Sophie Spirkl
2019	J	`jnl`	Bad news for chordal partitions. J. Graph Theory Alex Scott, Paul D. Seymour, David R. Wood
2019	J	`jnl`	Caterpillars in Erdős-Hajnal. J. Comb. Theory B Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl
2019	J	`jnl`	Clustered Colouring in Minor-Closed Classes. Comb. Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood
2019	J	`jnl`	Disjoint paths in unions of tournaments. J. Comb. Theory B Maria Chudnovsky, Alex Scott, Paul D. Seymour
2019	J	`jnl`	Excluded minors in cubic graphs. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
2019	J	`jnl`	Girth Six Cubic Graphs Have Petersen Minors. Comb. Neil Robertson, Paul D. Seymour, Robin Thomas
2019	J	`jnl`	H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2019	J	`jnl`	Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue. Comb. Alex D. Scott, Paul D. Seymour
2019	J	`jnl`	Induced subgraphs of graphs with large chromatic number. XI. Orientations. Eur. J. Comb. Maria Chudnovsky, Alex Scott, Paul D. Seymour
2019	J	`jnl`	Induced subgraphs of graphs with large chromatic number. XII. Distant stars. J. Graph Theory Maria Chudnovsky, Alex Scott, Paul D. Seymour
2019	J	`jnl`	Large rainbow matchings in general graphs. Eur. J. Comb. Ron Aharoni, Eli Berger, Maria Chudnovsky, David M. Howard, Paul D. Seymour
2019	J	`jnl`	Near-domination in graphs. J. Comb. Theory A Bruce A. Reed, Alex Scott, Paul D. Seymour
2019	J	`jnl`	Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
2018	J	`jnl`	Caterpillars in Erdős-Hajnal. CoRR Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl
2018	J	`jnl`	Corrigendum to "Even pairs and prism corners in square-free Berge graphs" [J. Combin. Theory, Ser. B 131 (2018) 12-39]. J. Comb. Theory B Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl
2018	J	`jnl`	Domination in tournaments. J. Comb. Theory B Maria Chudnovsky, Ringi Kim, Chun-Hung Liu, Paul D. Seymour, Stéphan Thomassé
2018	J	`jnl`	Even pairs and prism corners in square-free Berge graphs. J. Comb. Theory B Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl
2018	J	`jnl`	Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes. J. Comb. Theory B Alex Scott, Paul D. Seymour
2018	J	`jnl`	Triangle-free graphs with no six-vertex induced path. Discret. Math. Maria Chudnovsky, Paul D. Seymour, Sophie Spirkl, Mingxian Zhong
2017	J	`jnl`	Colouring perfect graphs with bounded clique number. CoRR Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl
2017	J	`jnl`	Colouring perfect graphs with bounded clique number. J. Comb. Theory B Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl
2017	J	`jnl`	Cyclically five-connected cubic graphs. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
2017	J	`jnl`	Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths. Electron. J. Comb. Alex Scott, Paul D. Seymour
2017	J	`jnl`	Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. Comb. Maria Chudnovsky, Alex Scott, Paul D. Seymour
2017	J	`jnl`	Majority Colourings of Digraphs. Electron. J. Comb. Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood
2017	J	`jnl`	Rooted grid minors. J. Comb. Theory B Dániel Marx, Paul D. Seymour, Paul Wollan
2016	J	`jnl`	Bipartite minors. J. Comb. Theory B Maria Chudnovsky, Gil Kalai, Eran Nevo, Isabella Novik, Paul D. Seymour
2016	J	`jnl`	Disjoint dijoins. J. Comb. Theory B Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul D. Seymour
2016	—	`ch.`	Hadwiger's Conjecture. Open Problems in Mathematics Paul D. Seymour
2016	J	`jnl`	Immersion in four-edge-connected graphs. J. Comb. Theory B Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour
2016	J	`jnl`	Induced subgraphs of graphs with large chromatic number. I. Odd holes. J. Comb. Theory B Alex Scott, Paul D. Seymour
2016	J	`jnl`	Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. J. Comb. Theory B Maria Chudnovsky, Alex Scott, Paul D. Seymour
2016	J	`jnl`	Three-edge-colouring doublecross cubic graphs. J. Comb. Theory B Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2016	J	`jnl`	Tree-chromatic number. J. Comb. Theory B Paul D. Seymour
2016	J	`jnl`	Unavoidable induced subgraphs in large graphs with no homogeneous sets. J. Comb. Theory B Maria Chudnovsky, Ringi Kim, Sang-il Oum, Paul D. Seymour
2015	J	`jnl`	A Relative of Hadwiger's Conjecture. SIAM J. Discret. Math. Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, Paul D. Seymour
2015	J	`jnl`	Criticality for multicommodity flows. J. Comb. Theory B Paul D. Seymour
2015	J	`jnl`	Cyclically five-connected cubic graphs. CoRR Neil Robertson, Paul D. Seymour, Robin Thomas
2015	J	`jnl`	Edge-colouring eight-regular planar graphs. J. Comb. Theory B Maria Chudnovsky, Katherine Edwards, Paul D. Seymour
2015	J	`jnl`	Edge-colouring seven-regular planar graphs. J. Comb. Theory B Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour
2015	J	`jnl`	Edge-disjoint paths in digraphs with bounded independence number. J. Comb. Theory B Alexandra Ovetsky Fradkin, Paul D. Seymour
2015	J	`jnl`	Excluding A Grid Minor In Planar Digraphs. CoRR Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
2015	J	`jnl`	Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour
2015	J	`jnl`	Excluding paths and antipaths. Comb. Maria Chudnovsky, Paul D. Seymour
2015	J	`jnl`	Tournament minors. J. Comb. Theory B Ilhee Kim, Paul D. Seymour
2015	J	`jnl`	Tree-width and planar minors. J. Comb. Theory B Alexander Leaf, Paul D. Seymour
2015	J	`jnl`	Wheel-free planar graphs. Eur. J. Comb. Pierre Aboulker, Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon
2014	J	`jnl`	Discharging cartwheels. CoRR Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2014	J	`jnl`	Excluding pairs of graphs. J. Comb. Theory B Maria Chudnovsky, Alex Scott, Paul D. Seymour
2014	J	`jnl`	Extending the Gyárfás-Sumner conjecture. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2014	J	`jnl`	Girth six cubic graphs have Petersen minors. CoRR Neil Robertson, Paul D. Seymour, Robin Thomas
2014	J	`jnl`	Proof of a conjecture of Bowlin and Brin on four-colouring triangulations. Eur. J. Comb. Paul D. Seymour
2014	J	`jnl`	Rao's degree sequence conjecture. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2014	J	`jnl`	Reducibility in the Four-Color Theorem. CoRR Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2014	J	`jnl`	Tournaments with near-linear transitive subsets. J. Comb. Theory B Krzysztof Choromanski, Maria Chudnovsky, Paul D. Seymour
2013	J	`jnl`	A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. SIAM J. Discret. Math. Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour
2013	J	`jnl`	A counterexample to a conjecture of Schwartz. Soc. Choice Welf. Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé
2013	J	`jnl`	Detecting an induced net subdivision. CoRR Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon
2013	J	`jnl`	Detecting an induced net subdivision. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon
2013	J	`jnl`	Immersion in four-edge-connected graphs. CoRR Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour
2013	J	`jnl`	Tournament pathwidth and topological containment. J. Comb. Theory B Alexandra Ovetsky Fradkin, Paul D. Seymour
2013	J	`jnl`	Tournaments and colouring. J. Comb. Theory B Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé
2012	J	`jnl`	Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. IEEE/ACM Trans. Netw. Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols
2012	J	`jnl`	Claw-free graphs. VII. Quasi-line graphs. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2012	J	`jnl`	Edge-colouring eight-regular planar graphs CoRR Maria Chudnovsky, Katherine Edwards, Paul D. Seymour
2012	J	`jnl`	Edge-colouring seven-regular planar graphs CoRR Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour
2012	J	`jnl`	Finding minimum clique capacity. Comb. Maria Chudnovsky, Sang-il Oum, Paul D. Seymour
2012	J	`jnl`	Graph Minors. XXII. Irrelevant vertices in linkage problems. J. Comb. Theory B Neil Robertson, Paul D. Seymour
2012	J	`jnl`	Growing Without Cloning. SIAM J. Discret. Math. Maria Chudnovsky, Paul D. Seymour
2012	J	`jnl`	Packing seagulls. Comb. Maria Chudnovsky, Paul D. Seymour
2012	J	`jnl`	Perfect matchings in planar cubic graphs. Comb. Maria Chudnovsky, Paul D. Seymour
2012	J	`jnl`	Three-colourable perfect graphs without even pairs. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2012	J	`jnl`	Tournament Minors CoRR Ilhee Kim, Paul D. Seymour
2012	J	`jnl`	Tournament immersion and cutwidth. J. Comb. Theory B Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour
2011	J	`jnl`	A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs CoRR Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour
2011	J	`jnl`	A well-quasi-order for tournaments. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2011	J	`jnl`	The edge-density for K J. Comb. Theory B Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour
2010	A*	`conf`	Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. INFOCOM Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols
2010	—	`conf`	Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. S3@MobiCom Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols
2010	J	`jnl`	Claw-free graphs VI. Colouring. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2010	J	`jnl`	Counting paths in digraphs. Eur. J. Comb. Paul D. Seymour, Blair D. Sullivan
2010	J	`jnl`	Graph minors XXIII. Nash-Williams' immersion conjecture. J. Comb. Theory B Neil Robertson, Paul D. Seymour
2010	J	`jnl`	K J. Comb. Theory B Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas
2010	J	`jnl`	The three-in-a-tree problem. Comb. Maria Chudnovsky, Paul D. Seymour
2009	J	`jnl`	Even pairs in Berge graphs. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2009	J	`jnl`	Graph minors. XXI. Graphs with unique linkages. J. Comb. Theory B Neil Robertson, Paul D. Seymour
2009	J	`jnl`	On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory B Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta
2008	J	`jnl`	Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory B Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour
2008	J	`jnl`	Claw-free graphs. II. Non-orientable prismatic graphs. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2008	J	`jnl`	Claw-free graphs. III. Circular interval graphs. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2008	J	`jnl`	Claw-free graphs. IV. Decomposition theorem. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2008	J	`jnl`	Claw-free graphs. V. Global structure. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2008	J	`jnl`	Cycles in dense digraphs. Comb. Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan
2008	J	`jnl`	Solution of three problems of Cornuéjols. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2007	J	`jnl`	Claw-free graphs. I. Orientable prismatic graphs. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2007	J	`jnl`	Testing branch-width. J. Comb. Theory B Sang-il Oum, Paul D. Seymour
2007	A*	`conf`	Testing for a theta. SODA Maria Chudnovsky, Paul D. Seymour
2007	J	`jnl`	The roots of the independence polynomial of a clawfree graph. J. Comb. Theory B Maria Chudnovsky, Paul D. Seymour
2006	J	`jnl`	Approximating clique-width and branch-width. J. Comb. Theory B Sang-il Oum, Paul D. Seymour
2006	A*	`conf`	Certifying large branch-width. SODA Sang-il Oum, Paul D. Seymour
2006	J	`jnl`	Disjoint paths in graphs. Discret. Math. Paul D. Seymour
2006	J	`jnl`	Packing Non-Zero A-Paths In Group-Labelled Graphs. Comb. Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour
2006	J	`jnl`	Proper minor-closed families are small. J. Comb. Theory B Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan
2006	J	`jnl`	Solution of two fractional packing problems of Lovász. Discret. Math. Alexander Schrijver, Paul D. Seymour
2005	J	`jnl`	Detecting even holes. J. Graph Theory Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour
2005	J	`jnl`	Recognizing Berge Graphs. Comb. Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic
2005	—	`conf`	The structure of claw-free graphs. BCC Maria Chudnovsky, Paul D. Seymour
2004	J	`jnl`	Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory B Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
2004	J	`jnl`	Graph Minors. XIX. Well-quasi-ordering on a surface. J. Comb. Theory B Neil Robertson, Paul D. Seymour
2004	J	`jnl`	Graph Minors. XX. Wagner's conjecture. J. Comb. Theory B Neil Robertson, Paul D. Seymour
2004	J	`jnl`	Hadwiger's conjecture for line graphs. Eur. J. Comb. Bruce A. Reed, Paul D. Seymour
2003	J	`jnl`	Extending partial 3-colourings in a planar graph. J. Comb. Theory B Matt DeVos, Paul D. Seymour
2003	J	`jnl`	Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory B Neil Robertson, Paul D. Seymour
2003	J	`jnl`	Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. J. Comb. Theory B Neil Robertson, Paul D. Seymour
2003	J	`jnl`	Progress on perfect graphs. Math. Program. Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas
2003	J	`jnl`	Tour Merging via Branch-Decomposition. INFORMS J. Comput. William J. Cook, Paul D. Seymour
2002	J	`jnl`	Coloring Locally Bipartite Graphs on Surfaces. J. Comb. Theory B Bojan Mohar, Paul D. Seymour
2002	J	`jnl`	Colouring Eulerian Triangulations. J. Comb. Theory B Joan P. Hutchinson, R. Bruce Richter, Paul D. Seymour
2001	J	`jnl`	Directed Tree-Width. J. Comb. Theory B Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
2001	J	`jnl`	Node Placement and Sizing for Copper Broadband Access Networks. Ann. Oper. Res. Tamra Carpenter, Martin I. Eiger, David Shallcross, Paul D. Seymour
2001	J	`jnl`	Spanning trees with many leaves. J. Graph Theory Guoli Ding, Thor Johnson, Paul D. Seymour
2000	J	`jnl`	Long cycles in critical graphs. J. Graph Theory Noga Alon, Michael Krivelevich, Paul D. Seymour
1999	J	`jnl`	Graph Minors: XVII. Taming a Vortex. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1999	J	`jnl`	The Ring Loading Problem. SIAM Rev. Alexander Schrijver, Paul D. Seymour, Peter Winkler
1998	J	`jnl`	A Note on List Arboricity. J. Comb. Theory B Paul D. Seymour
1998	J	`jnl`	A Petersen on a Pentagon. J. Comb. Theory B Paul D. Seymour, Klaus Truemper
1998	—	`conf`	AETGSM Web: A Web Based Service for Automatic Efficient Test Generation from Functional Requirements. WIFT Siddhartha R. Dalal, Ashish Jain, Gardner C. Patton, Manish Rathi, Paul D. Seymour
1998	J	`jnl`	Fractional Colouring and Hadwiger's Conjecture. J. Comb. Theory B Bruce A. Reed, Paul D. Seymour
1998	J	`jnl`	The Ring Loading Problem. SIAM J. Discret. Math. Alexander Schrijver, Paul D. Seymour, Peter Winkler
1997	A*	`conf`	Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas
1997	J	`jnl`	The Four-Colour Theorem. J. Comb. Theory B Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
1997	J	`jnl`	Tutte's Edge-Colouring Conjecture. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1997	J	`jnl`	Two Chromatic Polynomial Conjectures. J. Comb. Theory B Paul D. Seymour
1996	A*	`conf`	Efficiently Four-Coloring Planar Graphs. STOC Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
1996	J	`jnl`	Graph Minors: XV. Giant Steps. J. Comb. Theory, Ser. B Neil Robertson, Paul D. Seymour
1996	J	`jnl`	Irreducible Triangulations of Surfaces. J. Comb. Theory, Ser. B Zhicheng Gao, R. Bruce Richter, Paul D. Seymour
1996	J	`jnl`	Packing Circuits in Eulerian Digraphs. Comb. Paul D. Seymour
1996	J	`jnl`	Packing Directed Circuits. Comb. Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas
1996	J	`jnl`	Uniqueness of highly representative surface embeddings. J. Graph Theory Paul D. Seymour, Robin Thomas
1995	—	`ed.`	Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93 Combinatorial Optimization William J. Cook, László Lovász, Paul D. Seymour
1995	J	`jnl`	Graph Minors .XII. Distance on a Surface. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1995	J	`jnl`	Graph Minors .XIII. The Disjoint Paths Problem. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1995	J	`jnl`	Graph Minors .XIV. Extending an Embedding. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1995	J	`jnl`	Kuratowski Chains. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1995	J	`jnl`	Packing Directed Circuits Fractionally. Comb. Paul D. Seymour
1995	J	`jnl`	Petersen Family Minors. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1995	J	`jnl`	Sachs' Linkless Embedding Conjecture. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1994	J	`jnl`	A Note on Hyperplane Generation. J. Comb. Theory B Paul D. Seymour
1994	J	`jnl`	Bounding the Vertex Cover Number of a Hypergraph. Comb. Guoli Ding, Paul D. Seymour, Peter Winkler
1994	J	`jnl`	Call Routing and the Ratcatcher. Comb. Paul D. Seymour, Robin Thomas
1994	J	`jnl`	Circular embeddings of planar graphs in nonspherical surfaces. Discret. Math. R. Bruce Richter, Paul D. Seymour, Jozef Sirán
1994	J	`jnl`	Graph Minors. XI. Circuits on a Surface. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1994	J	`jnl`	Packing Odd Paths. J. Comb. Theory B Alexander Schrijver, Paul D. Seymour
1994	J	`jnl`	Planar Separators. SIAM J. Discret. Math. Noga Alon, Paul D. Seymour, Robin Thomas
1994	J	`jnl`	Quickly Excluding a Planar Graph. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1994	J	`jnl`	The Complexity of Multiterminal Cuts. SIAM J. Comput. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
1993	J	`jnl`	Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. J. Comb. Theory B Guoli Ding, Alexander Schrijver, Paul D. Seymour
1993	J	`jnl`	Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory B Paul D. Seymour, Robin Thomas
1993	—	`ed.`	Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA Graph Structure Theory Neil Robertson, Paul D. Seymour
1993	J	`jnl`	Hadwiger's conjecture for K Comb. Neil Robertson, Paul D. Seymour, Robin Thomas
1993	J	`jnl`	On the fractional matching polytope of a hypergraph. Comb. Zoltán Füredi, Jeff Kahn, Paul D. Seymour
1992	J	`jnl`	A fractional version of the Erdös-Faber-Lovász conjecture. Comb. Jeff Kahn, Paul D. Seymour
1992	J	`jnl`	Directed triangles in directed graphs. Discret. Math. Maurits de Graaf, Alexander Schrijver, Paul D. Seymour
1992	J	`jnl`	Disjoint Paths in a Planar Graph - A General Theorem. SIAM J. Discret. Math. Guoli Ding, Alexander Schrijver, Paul D. Seymour
1992	J	`jnl`	On secret-sharing matroids. J. Comb. Theory B Paul D. Seymour
1992	A*	`conf`	The Complexity of Multiway Cuts (Extended Abstract) STOC Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
1991	J	`jnl`	A simpler proof and a generalization of the zero-trees theorem. J. Comb. Theory A Alexander Schrijver, Paul D. Seymour
1991	—	`conf`	A survey of linkless embeddings. Graph Structure Theory Neil Robertson, Paul D. Seymour, Robin Thomas
1991	J	`jnl`	An end-faithful spanning tree counterexample. Discret. Math. Paul D. Seymour, Robin Thomas
1991	J	`jnl`	Directed circuits on a torus. Comb. Paul D. Seymour
1991	—	`conf`	Excluding a graph with one crossing. Graph Structure Theory Neil Robertson, Paul D. Seymour
1991	J	`jnl`	Excluding infinite minors. Discret. Math. Neil Robertson, Paul D. Seymour, Robin Thomas
1991	—	`conf`	Finding disjoint trees in planar graphs in linear time. Graph Structure Theory Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour
1991	J	`jnl`	Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1991	J	`jnl`	Monotonicity in Graph Searching. J. Algorithms Daniel Bienstock, Paul D. Seymour
1991	J	`jnl`	Quickly excluding a forest. J. Comb. Theory B Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas
1991	—	`conf`	Structural descriptions of lower ideals of trees. Graph Structure Theory Neil Robertson, Paul D. Seymour, Robin Thomas
1990	A*	`conf`	A Separator Theorem for Graphs with an Excluded Minor and its Applications STOC Noga Alon, Paul D. Seymour, Robin Thomas
1990	J	`jnl`	Colouring series-parallel graphs. Comb. Paul D. Seymour
1990	J	`jnl`	Extending an edge-coloring. J. Graph Theory Odile Marcotte, Paul D. Seymour
1990	J	`jnl`	Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1990	J	`jnl`	Graph minors. IX. Disjoint crossed paths. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1990	J	`jnl`	Graph minors. VIII. A kuratowski theorem for general surfaces. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1990	—	`conf`	On Lehman's Width-Length Characterization. Polyhedral Combinatorics Paul D. Seymour
1990	—	`ed.`	Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989 Polyhedral Combinatorics William J. Cook, Paul D. Seymour
1990	—	`conf`	Spanning Trees of Different Weights. Polyhedral Combinatorics Alexander Schrijver, Paul D. Seymour
1989	J	`jnl`	A counterexample to the rank-coloring conjecture. J. Graph Theory Noga Alon, Paul D. Seymour
1989	J	`jnl`	Graphs with small bandwidth and cutwidth. Discret. Math. Fan R. K. Chung, Paul D. Seymour
1988	J	`jnl`	Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1988	J	`jnl`	On induced subgraphs of the cube. J. Comb. Theory A Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour
1988	J	`jnl`	On the connectivity function of a matroid. J. Comb. Theory B Paul D. Seymour
1988	J	`jnl`	Self-organizing Sequential Search and Hilbert's Inequalities. J. Comput. Syst. Sci. Fan R. K. Chung, D. J. Hajela, Paul D. Seymour
1987	J	`jnl`	Characterization of even directed graphs. J. Comb. Theory B Paul D. Seymour, Carsten Thomassen
1987	J	`jnl`	Large induced degenerate subgraphs. Graphs Comb. Noga Alon, Jeff Kahn, Paul D. Seymour
1987	J	`jnl`	Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour
1987	J	`jnl`	The smallets n-uniform hypergraph with positive discrepancy. Comb. Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
1986	J	`jnl`	Adjacency in Binary Matroids. Eur. J. Comb. Paul D. Seymour
1986	J	`jnl`	Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms Neil Robertson, Paul D. Seymour
1986	J	`jnl`	Graph minors. V. Excluding a planar graph. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1986	J	`jnl`	Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1986	J	`jnl`	Triples in Matroid Circuits. Eur. J. Comb. Paul D. Seymour
1985	J	`jnl`	Counting points in hypercubes and convolution measure algebras. Comb. D. J. Hajela, Paul D. Seymour
1985	J	`jnl`	Minors of 3-Connected Matroids. Eur. J. Comb. Paul D. Seymour
1985	A*	`conf`	Self-Organizing Sequential Search and Hilbert's Inequalities STOC Fan R. K. Chung, D. J. Hajela, Paul D. Seymour
1984	J	`jnl`	A generalization of chordal graphs. J. Graph Theory Paul D. Seymour, R. W. Weaver
1984	J	`jnl`	A note on nongraphic matroids. J. Comb. Theory B Takao Asano, Takao Nishizeki, Paul D. Seymour
1984	J	`jnl`	Graph minors. III. Planar tree-width. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1983	J	`jnl`	Graph minors. I. Excluding a forest. J. Comb. Theory B Neil Robertson, Paul D. Seymour
1982	J	`jnl`	Packing nearly-disjoint sets. Comb. Paul D. Seymour
1981	J	`jnl`	Even circuits in planar graphs. J. Comb. Theory B Paul D. Seymour
1981	J	`jnl`	Matroids and Multicommodity Flows. Eur. J. Comb. Paul D. Seymour
1981	J	`jnl`	Multicommodity flows in planar graphs. J. Comb. Theory B Haruko Okamura, Paul D. Seymour
1981	J	`jnl`	Nowhere-zero 6-flows. J. Comb. Theory B Paul D. Seymour
1981	J	`jnl`	On Tutte's extension of the four-colour problem. J. Comb. Theory B Paul D. Seymour
1981	J	`jnl`	On minors of non-binary matroids. Comb. Paul D. Seymour
1981	J	`jnl`	Reconizing graphic matroids. Comb. Paul D. Seymour
1980	J	`jnl`	Decomposition of regular matroids. J. Comb. Theory B Paul D. Seymour
1980	J	`jnl`	Disjoint paths in graphs. Discret. Math. Paul D. Seymour
1980	J	`jnl`	Four-terminus flows. Networks Paul D. Seymour
1980	J	`jnl`	Packing and covering with matroid circuits. J. Comb. Theory B Paul D. Seymour
1979	J	`jnl`	A short proof of the two-commodity flow theorem. J. Comb. Theory B Paul D. Seymour
1979	J	`jnl`	Matroid representation over GF(3). J. Comb. Theory B Paul D. Seymour
1979	J	`jnl`	Solution of two fractional packing problems of lovász. Discret. Math. Alexander Schrijver, Paul D. Seymour
1978	J	`jnl`	A two-commodity cut theorem. Discret. Math. Paul D. Seymour
1978	J	`jnl`	Counterexample to a conjecture of Jeurissen. Discret. Math. Paul D. Seymour
1977	J	`jnl`	A note on the production of matroid minors. J. Comb. Theory B Paul D. Seymour
1977	J	`jnl`	The matroids with the max-flow min-cut property. J. Comb. Theory B Paul D. Seymour