☰

Paul D. Seymour - Publications

Affiliations: 
Mathematics Princeton University, Princeton, NJ 
Tree Info Similar researchers PubMed Report error

199 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Chudnovsky M, Scott A, Seymour PD, Spirkl S. Detecting an odd hole Journal of the Acm. 67: 1-12. DOI: 10.1145/3375720  0.555
2020 Addario-Berry L, Chudnovsky M, Havet F, Reed BA, Seymour PD. Corrigendum to “Bisimplicial vertices in even-hole-free graphs” Journal of Combinatorial Theory, Series B. 142: 374-375. DOI: 10.1016/J.Jctb.2020.02.001  0.617
2020 Scott A, Seymour P. Induced subgraphs of graphs with large chromatic number. VI. Banana trees Journal of Combinatorial Theory, Series B. DOI: 10.1016/J.Jctb.2020.01.004  0.589
2020 Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture Journal of Combinatorial Theory, Series B. 142: 43-55. DOI: 10.1016/J.Jctb.2019.08.008  0.622
2020 Chudnovsky M, Scott A, Seymour PD, Spirkl S. Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes Journal of Combinatorial Theory, Series B. 140: 84-97. DOI: 10.1016/J.Jctb.2019.05.001  0.731
2020 Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. XIII. New brooms European Journal of Combinatorics. 84: 103024. DOI: 10.1016/J.Ejc.2019.103024  0.543
2020 Chudnovsky M, Cook L, Seymour PD. Excluding the fork and antifork Discrete Mathematics. 343: 111786. DOI: 10.1016/J.Disc.2019.111786  0.787
2020 Chudnovsky M, Scott A, Seymour P, Spirkl S. Pure pairs. I. Trees and linear anticomplete pairs Advances in Mathematics. 107396. DOI: 10.1016/J.Aim.2020.107396  0.739
2020 Chudnovsky M, Scott A, Seymour P, Spirkl S. Proof of the Kalai-Meshulam conjecture Israel Journal of Mathematics. 238: 639-661. DOI: 10.1007/S11856-020-2034-8  0.748
2020 Chudnovsky M, Fox J, Scott A, Seymour P, Spirkl S. Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs Journal of Graph Theory. DOI: 10.1002/Jgt.22556  0.741
2019 Robertson N, Seymour PD, Thomas R. Excluded minors in cubic graphs Journal of Combinatorial Theory, Series B. 138: 219-285. DOI: 10.1016/J.Jctb.2019.02.002  0.606
2019 Liebenau A, Pilipczuk M, Seymour PD, Spirkl S. Caterpillars in Erdős–Hajnal Journal of Combinatorial Theory, Series B. 136: 33-43. DOI: 10.1016/J.Jctb.2018.09.002  0.519
2019 Chudnovsky M, Scott A, Seymour PD. Disjoint paths in unions of tournaments Journal of Combinatorial Theory, Series B. 135: 238-255. DOI: 10.1016/J.Jctb.2018.08.007  0.713
2019 Reed B, Scott A, Seymour PD. Near-domination in graphs Journal of Combinatorial Theory, Series A. 165: 392-407. DOI: 10.1016/J.Jcta.2019.02.009  0.585
2019 Aharoni R, Berger E, Chudnovsky M, Howard DM, Seymour PD. Large rainbow matchings in general graphs European Journal of Combinatorics. 79: 222-227. DOI: 10.1016/J.Ejc.2019.01.012  0.741
2019 Chudnovsky M, Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. XI. Orientations European Journal of Combinatorics. 76: 53-61. DOI: 10.1016/J.Ejc.2018.09.003  0.775
2019 Groenland C, Okrasa K, Rzążewski P, Scott A, Seymour P, Spirkl S. H-colouring Pt-free graphs in subexponential time Discrete Applied Mathematics. 267: 184-189. DOI: 10.1016/J.Dam.2019.04.010  0.59
2019 Chudnovsky M, Fox J, Scott AD, Seymour PD, Spirkl S. Towards Erdős-Hajnal for graphs with no 5-hole Combinatorica. 39: 983-991. DOI: 10.1007/S00493-019-3957-8  0.737
2019 Norin S, Scott AD, Seymour P, Wood DR. Clustered Colouring in Minor-Closed Classes Combinatorica. 39: 1387-1412. DOI: 10.1007/S00493-019-3848-Z  0.569
2019 Scott AD, Seymour PD. Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue Combinatorica. 39: 1105-1132. DOI: 10.1007/S00493-019-3804-Y  0.624
2019 Robertson N, Seymour PD, Thomas R. Girth six cubic graphs have Petersen minors Combinatorica. 39: 1413-1423. DOI: 10.1007/S00493-019-3268-0  0.634
2019 Chudnovsky M, Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. XII. Distant stars Journal of Graph Theory. 92: 237-254. DOI: 10.1002/Jgt.22450  0.75
2019 Scott A, Seymour PD, Wood DR. Bad news for chordal partitions Journal of Graph Theory. 90: 5-12. DOI: 10.1002/Jgt.22363  0.632
2018 Chudnovsky M, Maffray F, Seymour PD, Spirkl S. Corrigendum to “Even pairs and prism corners in square-free Berge graphs” [J. Combin. Theory, Ser. B 131 (2018) 12–39] Journal of Combinatorial Theory, Series B. 133: 259-260. DOI: 10.1016/J.Jctb.2018.07.004  0.558
2018 Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes Journal of Combinatorial Theory, Series B. 132: 180-235. DOI: 10.1016/J.Jctb.2018.03.006  0.615
2018 Chudnovsky M, Maffray F, Seymour PD, Spirkl S. Even pairs and prism corners in square-free Berge graphs Journal of Combinatorial Theory, Series B. 131: 12-39. DOI: 10.1016/J.Jctb.2018.01.003  0.802
2018 Chudnovsky M, Seymour PD, Spirkl S, Zhong M. Triangle-free graphs with no six-vertex induced path Discrete Mathematics. 341: 2179-2196. DOI: 10.1016/J.Disc.2018.04.020  0.785
2017 Scott A, Seymour PD. Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths Electronic Journal of Combinatorics. 24: 2-53. DOI: 10.37236/6768  0.616
2017 Kreutzer S, Oum S, Seymour PD, Zypen Dvd, Wood DR. Majority Colourings of Digraphs Electronic Journal of Combinatorics. 24: 2-25. DOI: 10.37236/6410  0.714
2017 Chudnovsky M, Kim R, Liu C, Seymour PD, Thomassé S. Domination in tournaments Journal of Combinatorial Theory, Series B. 130: 98-113. DOI: 10.1016/J.Jctb.2017.10.001  0.646
2017 Robertson N, Seymour PD, Thomas R. Cyclically Five-Connected Cubic Graphs Journal of Combinatorial Theory, Series B. 125: 132-167. DOI: 10.1016/J.Jctb.2017.03.003  0.576
2017 Chudnovsky M, Lagoutte A, Seymour PD, Spirkl S. Colouring perfect graphs with bounded clique number Journal of Combinatorial Theory, Series B. 122: 757-775. DOI: 10.1016/J.Jctb.2016.09.006  0.783
2017 Marx D, Seymour PD, Wollan P. Rooted grid minors Journal of Combinatorial Theory, Series B. 122: 428-437. DOI: 10.1016/J.Jctb.2016.07.003  0.583
2017 Chudnovsky M, Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. III. Long holes Combinatorica. 37: 1057-1072. DOI: 10.1007/S00493-016-3467-X  0.741
2016 Chudnovsky M, Kim R, Oum SI, Seymour P. Unavoidable induced subgraphs in large graphs with no homogeneous sets Journal of Combinatorial Theory. Series B. 118: 1-12. DOI: 10.1016/J.Jctb.2016.01.008  0.857
2016 Chudnovsky M, Scott A, Seymour P. Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures Journal of Combinatorial Theory. Series B. 118: 109-128. DOI: 10.1016/J.Jctb.2016.01.003  0.761
2016 Scott A, Seymour PD. Induced subgraphs of graphs with large chromatic number. I. Odd holes Journal of Combinatorial Theory, Series B. 121: 68-84. DOI: 10.1016/J.Jctb.2015.10.002  0.603
2016 Seymour P. Tree-chromatic number Journal of Combinatorial Theory, Series B. 116: 229-237. DOI: 10.1016/J.Jctb.2015.08.002  0.505
2016 Chudnovsky M, Kalai G, Nevo E, Novik I, Seymour P. Bipartite minors Journal of Combinatorial Theory. Series B. 116: 219-228. DOI: 10.1016/J.Jctb.2015.08.001  0.793
2016 Chudnovsky M, Dvořák Z, Klimošová T, Seymour P. Immersion in four-edge-connected graphs Journal of Combinatorial Theory. Series B. 116: 208-218. DOI: 10.1016/J.Jctb.2015.07.006  0.792
2015 Edwards K, Kang DY, Kim J, Oum SI, Seymour PD. A relative of Hadwiger's conjecture Siam Journal On Discrete Mathematics. 29: 2385-2388. DOI: 10.1137/141002177  0.424
2015 Chudnovsky M, Norin S, Reed B, Seymour P. Excluding a substar and an antisubstar Siam Journal On Discrete Mathematics. 29: 297-308. DOI: 10.1137/130946113  0.75
2015 Chudnovsky M, Edwards K, Seymour P. Edge-colouring eight-regular planar graphs Journal of Combinatorial Theory. Series B. 115: 303-338. DOI: 10.1016/J.Jctb.2015.05.002  0.689
2015 Chudnovsky M, Edwards K, Kawarabayashi Ki, Seymour P. Edge-colouring seven-regular planar graphs Journal of Combinatorial Theory. Series B. 115: 276-302. DOI: 10.1016/J.Jctb.2014.11.005  0.631
2015 Leaf A, Seymour P. Tree-width and planar minors Journal of Combinatorial Theory. Series B. 111: 38-53. DOI: 10.1016/J.Jctb.2014.09.003  0.379
2015 Seymour P. Criticality for multicommodity flows Journal of Combinatorial Theory, Series B. 110: 136-179. DOI: 10.1016/J.Jctb.2014.08.001  0.423
2015 Fradkin A, Seymour P. Edge-disjoint paths in digraphs with bounded independence number Journal of Combinatorial Theory, Series B. 110: 19-46. DOI: 10.1016/J.Jctb.2014.07.002  0.851
2015 Aboulker P, Chudnovsky M, Seymour P, Trotignon N. Wheel-free planar graphs European Journal of Combinatorics. 49: 57-67. DOI: 10.1016/J.Ejc.2015.02.027  0.783
2015 Chudnovsky M, Scott A, Seymour P. Disjoint paths in tournaments Advances in Mathematics. 270: 582-597. DOI: 10.1016/J.Aim.2014.11.011  0.69
2014 Edwards K, Sanders DP, Seymour P, Thomas R. Three-edge-colouring doublecross cubic graphs Journal of Combinatorial Theory. Series B. DOI: 10.1016/J.Jctb.2015.12.006  0.635
2014 Choromanski K, Chudnovsky M, Seymour P. Tournaments with near-linear transitive subsets Journal of Combinatorial Theory. Series B. 109: 228-249. DOI: 10.1016/J.Jctb.2014.06.007  0.807
2014 Chudnovsky M, Scott A, Seymour P. Excluding pairs of graphs Journal of Combinatorial Theory. Series B. 106: 15-29. DOI: 10.1016/J.Jctb.2014.01.001  0.776
2014 Chudnovsky M, Seymour P. Rao's degree sequence conjecture Journal of Combinatorial Theory. Series B. 105: 44-92. DOI: 10.1016/J.Jctb.2013.12.003  0.774
2014 Chudnovsky M, Seymour P. Extending the Gyárfás-Sumner conjecture Journal of Combinatorial Theory. Series B. 105: 11-16. DOI: 10.1016/J.Jctb.2013.11.002  0.782
2014 Seymour P. Proof of a conjecture of Bowlin and Brin on four-colouring triangulations European Journal of Combinatorics. 38: 79-82. DOI: 10.1016/J.Ejc.2013.11.005  0.344
2014 Chudnovsky M, Seymour P. Excluding paths and antipaths Combinatorica. 35: 389-412. DOI: 10.1007/S00493-014-3000-Z  0.764
2013 Chudnovsky M, King AD, Plumettaz M, Seymour P. A local strengthening of reed's ω, δ, χ conjecture for quasi-line graphs Siam Journal On Discrete Mathematics. 27: 95-108. DOI: 10.1137/110847585  0.841
2013 Chudnovsky M, Seymour P, Trotignon N. Detecting an induced net subdivision Journal of Combinatorial Theory. Series B. 103: 630-641. DOI: 10.1016/J.Jctb.2013.07.005  0.733
2013 Fradkin A, Seymour P. Tournament pathwidth and topological containment Journal of Combinatorial Theory, Series B. 103: 374-384. DOI: 10.1016/J.Jctb.2013.03.001  0.796
2013 Berger E, Choromanski K, Chudnovsky M, Fox J, Loebl M, Scott A, Seymour P, Thomassé S. Tournaments and colouring Journal of Combinatorial Theory. Series B. 103: 1-20. DOI: 10.1016/J.Jctb.2012.08.003  0.823
2013 Brandt F, Chudnovsky M, Kim I, Liu G, Norin S, Scott A, Seymour P, Thomassé S. A counterexample to a conjecture of Schwartz Social Choice and Welfare. 40: 739-743. DOI: 10.1007/S00355-011-0638-Y  0.682
2012 Chudnovsky M, Seymour P. Growing without cloning Siam Journal On Discrete Mathematics. 26: 860-880. DOI: 10.1137/100817255  0.777
2012 Birand B, Chudnovsky M, Ries B, Seymour P, Zussman G, Zwols Y. Analyzing the performance of greedy maximal scheduling via local pooling and graph theory Ieee/Acm Transactions On Networking. 20: 163-176. DOI: 10.1109/Tnet.2011.2157831  0.827
2012 Chudnovsky M, Seymour P. Claw-free graphs. VII. Quasi-line graphs Journal of Combinatorial Theory. Series B. 102: 1267-1294. DOI: 10.1016/J.Jctb.2012.07.005  0.776
2012 Chudnovsky M, Seymour P. Three-colourable perfect graphs without even pairs Journal of Combinatorial Theory. Series B. 102: 363-394. DOI: 10.1016/J.Jctb.2011.11.005  0.786
2012 Chudnovsky M, Fradkin A, Seymour P. Tournament immersion and cutwidth Journal of Combinatorial Theory. Series B. 102: 93-101. DOI: 10.1016/J.Jctb.2011.05.001  0.826
2012 Robertson N, Seymour P. Graph Minors. XXII. Irrelevant vertices in linkage problems Journal of Combinatorial Theory, Series B. 102: 530-563. DOI: 10.1016/J.Jctb.2007.12.007  0.575
2012 Chudnovsky M, Oum SI, Seymour P. Finding minimum clique capacity Combinatorica. 32: 283-287. DOI: 10.1007/S00493-012-2891-9  0.758
2012 Chudnovsky M, Seymour P. Perfect matchings in planar cubic graphs Combinatorica. 32: 403-424. DOI: 10.1007/S00493-012-2660-9  0.775
2011 Chudnovsky M, Reed B, Seymour P. The edge-density for K2,t minors Journal of Combinatorial Theory. Series B. 101: 18-46. DOI: 10.1016/J.Jctb.2010.09.001  0.744
2010 Chudnovsky M, Seymour P. Claw-free graphs VI. Colouring Journal of Combinatorial Theory. Series B. 100: 560-572. DOI: 10.1016/J.Jctb.2010.04.005  0.779
2010 Chudnovsky M, Robertson N, Seymour P, Thomas R. K4-free graphs with no odd holes Journal of Combinatorial Theory. Series B. 100: 313-331. DOI: 10.1016/J.Jctb.2009.10.001  0.784
2010 Robertson N, Seymour P. Graph minors XXIII. Nash-Williams' immersion conjecture Journal of Combinatorial Theory, Series B. 100: 181-205. DOI: 10.1016/J.Jctb.2009.07.003  0.601
2010 Seymour P, Sullivan BD. Counting paths in digraphs European Journal of Combinatorics. 31: 961-975. DOI: 10.1016/J.Ejc.2009.05.008  0.692
2010 Chudnovsky M, Seymour P. THE THREE-IN-A-TREE PROBLEM Combinatorica. 30: 387-417. DOI: 10.1007/S00493-010-2334-4  0.764
2009 Robertson N, Seymour P. Graph minors. XXI. Graphs with unique linkages Journal of Combinatorial Theory, Series B. 99: 583-616. DOI: 10.1016/J.Jctb.2008.08.003  0.608
2009 Chudnovsky M, Seymour P. Even pairs in Berge graphs Journal of Combinatorial Theory. Series B. 99: 370-377. DOI: 10.1016/J.Jctb.2008.08.002  0.757
2009 Geelen J, Gerards B, Reed B, Seymour P, Vetta A. On the odd-minor variant of Hadwiger's conjecture Journal of Combinatorial Theory, Series B. 99: 20-29. DOI: 10.1016/J.Jctb.2008.03.006  0.547
2008 Chudnovsky M, Seymour P. Claw-free graphs. V. Global structure Journal of Combinatorial Theory. Series B. 98: 1373-1410. DOI: 10.1016/J.Jctb.2008.03.002  0.774
2008 Chudnovsky M, Seymour P. Claw-free graphs. III. Circular interval graphs Journal of Combinatorial Theory. Series B. 98: 812-834. DOI: 10.1016/J.Jctb.2008.03.001  0.798
2008 Addario-Berry L, Chudnovsky M, Havet F, Reed B, Seymour P. Bisimplicial vertices in even-hole-free graphs Journal of Combinatorial Theory. Series B. 98: 1119-1164. DOI: 10.1016/J.Jctb.2007.12.006  0.783
2008 Chudnovsky M, Seymour P. Claw-free graphs. IV. Decomposition theorem Journal of Combinatorial Theory. Series B. 98: 839-938. DOI: 10.1016/J.Jctb.2007.06.007  0.774
2008 Chudnovsky M, Seymour P. Claw-free graphs. II. Non-orientable prismatic graphs Journal of Combinatorial Theory. Series B. 98: 249-290. DOI: 10.1016/J.Jctb.2007.06.006  0.782
2008 Chudnovsky M, Seymour P. Solution of three problems of Cornuéjols Journal of Combinatorial Theory. Series B. 98: 116-135. DOI: 10.1016/J.Jctb.2007.05.004  0.712
2008 Chudnovsky M, Seymour P, Sullivan B. Cycles in dense digraphs Combinatorica. 28: 1-18. DOI: 10.1007/S00493-008-2331-Z  0.779
2007 Chudnovsky M, Seymour P. Claw-free graphs. I. Orientable prismatic graphs Journal of Combinatorial Theory. Series B. 97: 867-903. DOI: 10.1016/J.Jctb.2007.02.002  0.779
2007 Oum S, Seymour P. Testing branch-width Journal of Combinatorial Theory, Series B. 97: 385-393. DOI: 10.1016/J.Jctb.2006.06.006  0.701
2007 Chudnovsky M, Seymour P. The roots of the independence polynomial of a clawfree graph Journal of Combinatorial Theory. Series B. 97: 350-357. DOI: 10.1016/J.Jctb.2006.06.001  0.78
2006 Chudnovsky M, Robertson N, Seymour P, Thomas R. The strong perfect graph theorem Annals of Mathematics. 164: 51-229. DOI: 10.4007/Annals.2006.164.51  0.802
2006 Norine S, Seymour P, Thomas R, Wollan P. Proper minor-closed families are small Journal of Combinatorial Theory, Series B. 96: 754-757. DOI: 10.1016/J.Jctb.2006.01.006  0.534
2006 Oum S, Seymour P. Approximating clique-width and branch-width Journal of Combinatorial Theory, Series B. 96: 514-528. DOI: 10.1016/J.Jctb.2005.10.006  0.799
2006 Seymour PD. Disjoint paths in graphs Discrete Mathematics. 306: 979-991. DOI: 10.1016/J.Disc.2006.03.019  0.432
2006 Schrijver A, Seymour PD. Solution of two fractional packing problems of Lovász Discrete Mathematics. 306: 973-978. DOI: 10.1016/J.Disc.2006.03.018  0.366
2006 Chudnovsky M, Geelen J, Gerards B, Goddyn L, Lohman M, Seymour P. Packing non-zero A-paths in group-labelled graphs Combinatorica. 26: 521-532. DOI: 10.1007/S00493-006-0030-1  0.745
2005 Chudnovsky M, Cornuéjols G, Liu X, Seymour P, Vušković K. Recognizing Berge Graphs Combinatorica. 25: 143-186. DOI: 10.1007/S00493-005-0012-8  0.788
2005 Chudnovsky M, Kawarabayashi KI, Seymour P. Detecting even holes Journal of Graph Theory. 48: 85-111. DOI: 10.1002/Jgt.V48:2  0.694
2004 Robertson N, Seymour PD. Graph Minors. XX. Wagner's conjecture Journal of Combinatorial Theory. Series B. 92: 325-357. DOI: 10.1016/J.Jctb.2004.08.001  0.574
2004 DeVos M, Ding G, Oporowski B, Sanders DP, Reed B, Seymour P, Vertigan D. Excluding any graph as a minor allows a low tree-width 2-coloring Journal of Combinatorial Theory. Series B. 91: 25-41. DOI: 10.1016/J.Jctb.2003.09.001  0.655
2004 Robertson N, Seymour PD. Graph minors. XIX. Well-quasi-ordering on a surface Journal of Combinatorial Theory. Series B. 90: 325-385. DOI: 10.1016/J.Jctb.2003.08.005  0.606
2004 Reed B, Seymour P. Hadwiger's conjecture for line graphs European Journal of Combinatorics. 25: 873-876. DOI: 10.1016/J.Ejc.2003.09.020  0.614
2003 Cook W, Seymour P. Tour Merging via Branch-Decomposition Informs Journal On Computing. 15: 233-248. DOI: 10.1287/Ijoc.15.3.233.16078  0.528
2003 Robertson N, Seymour P. Graph minors. XVIII. tree-decompositions and well-quasi-ordering Journal of Combinatorial Theory, Series B. 89: 77-108. DOI: 10.1016/S0095-8956(03)00067-4  0.621
2003 Robertson N, Seymour PD. Graph minors. XVI. Excluding a non-planar graph Journal of Combinatorial Theory. Series B. 89: 43-76. DOI: 10.1016/S0095-8956(03)00042-X  0.556
2003 DeVos M, Seymour P. Extending partial 3-colourings in a planar graph Journal of Combinatorial Theory, Series B. 88: 219-225. DOI: 10.1016/S0095-8956(02)00005-9  0.509
2003 Chudnovsky M, Robertson N, Seymour PD, Thomas R. Progress on perfect graphs Mathematical Programming. 97: 405-422. DOI: 10.1007/S10107-003-0449-8  0.771
2002 Mohar B, Seymour PD. Coloring locally bipartite graphs on surfaces Journal of Combinatorial Theory. Series B. 84: 301-310. DOI: 10.1006/Jctb.2001.2086  0.529
2001 Johnson T, Robertson N, Seymour PD, Thomas R. Directed tree-width Journal of Combinatorial Theory. Series B. 82: 138-154. DOI: 10.1006/Jctb.2000.2031  0.539
2001 Ding G, Johnson T, Seymour P. Spanning trees with many leaves Journal of Graph Theory. 37: 189-197. DOI: 10.1002/Jgt.V37:4  0.511
2000 Alon N, Krivelevich M, Seymour P. Long cycles in critical graphs Journal of Graph Theory. 35: 193-196. DOI: 10.1002/1097-0118(200011)35:3<>1.0.Co;2-0  0.385
1999 Robertson N, Seymour PD, Thomas R. Permanents, Pfaffian orientations, and even directed circuits Annals of Mathematics. 150: 929-975. DOI: 10.2307/121059  0.536
1999 Schrijver A, Seymour P, Winkler P. The Ring Loading Problem Siam Review. 41: 777-791. DOI: 10.1137/S0036144599356470  0.346
1999 Robertson N, Seymour PD. Graph Minors: XVII. Taming a Vortex Journal of Combinatorial Theory. Series B. 77: 162-210. DOI: 10.1006/Jctb.1999.1919  0.596
1998 Schrijver A, Seymour P, Winkler P. The Ring Loading Problem Siam Journal On Discrete Mathematics. 11: 1-14. DOI: 10.1137/S0895480195294994  0.344
1998 Reed B, Seymour P. Fractional Colouring and Hadwiger's Conjecture Journal of Combinatorial Theory, Series B. 74: 147-152. DOI: 10.1006/Jctb.1998.1835  0.453
1998 Seymour P, Truemper K. A Petersen on a Pentagon Journal of Combinatorial Theory, Series B. 72: 63-79. DOI: 10.1006/Jctb.1997.1791  0.633
1998 Seymour PD. A note on list arboricity Journal of Combinatorial Theory. Series B. 72: 150-151. DOI: 10.1006/Jctb.1997.1784  0.635
1997 Robertson N, Seymour P, Thomas R. Tutte's Edge-Colouring Conjecture Journal of Combinatorial Theory, Series B. 70: 166-183. DOI: 10.1006/Jctb.1997.1752  0.643
1997 Robertson N, Sanders D, Seymour P, Thomas R. The Four-Colour Theorem Journal of Combinatorial Theory, Series B. 70: 2-44. DOI: 10.1006/Jctb.1997.1750  0.584
1997 Seymour P. Two Chromatic Polynomial Conjectures Journal of Combinatorial Theory, Series B. 70: 184-196. DOI: 10.1006/Jctb.1997.1749  0.41
1996 Robertson N, Sanders DP, Seymour P, Thomas R. Electronic Research Announcements of the American Mathematical Society. 2: 17-26. DOI: 10.1090/S1079-6762-96-00003-0  0.618
1996 Seymour PD. Packing circuits in Eulerian digraphs Combinatorica. 16: 223-231. DOI: 10.1007/Bf01844848  0.435
1996 Reed B, Robertson N, Seymour PD, Thomas R. Packing directed circuits Combinatorica. 16: 535-554. DOI: 10.1007/Bf01271272  0.34
1996 Robertson N, Seymour PD. Graph minors XV. Giant steps Journal of Combinatorial Theory. Series B. 68: 112-148. DOI: 10.1006/Jctb.1996.0059  0.596
1995 Seymour PD. Packing directed circuits fractionally Combinatorica. 15: 281-288. DOI: 10.1007/Bf01200760  0.355
1995 Robertson N, Seymour PD. Graph Miners .XIV. Extending an Embedding Journal of Combinatorial Theory, Series B. 65: 23-50. DOI: 10.1006/Jctb.1995.1042  0.635
1995 Robertson N, Seymour PD. Graph Minors .XII. Distance on a Surface Journal of Combinatorial Theory, Series B. 64: 240-272. DOI: 10.1006/Jctb.1995.1034  0.494
1995 Robertson N, Seymour P, Thomas R. Sachs' linkless embedding conjecture Journal of Combinatorial Theory, Series B. 64: 185-227. DOI: 10.1006/Jctb.1995.1032  0.628
1995 Robertson N, Seymour P, Thomas R. Petersen family minors Journal of Combinatorial Theory, Series B. 64: 155-184. DOI: 10.1006/Jctb.1995.1031  0.597
1995 Robertson N, Seymour PD. Graph Minors .XIII. The Disjoint Paths Problem Journal of Combinatorial Theory, Series B. 63: 65-110. DOI: 10.1006/Jctb.1995.1006  0.59
1994 Dahlhaus E, Johnson DS, Papadimitriou CH, Seymour PD, Yannakakis M. The Complexity of Multiterminal Cuts Siam Journal On Computing. 23: 864-894. DOI: 10.1137/S0097539792225297  0.523
1994 Richter RB, Seymour PD, Širáň J. Circular embeddings of planar graphs in nonspherical surfaces Discrete Mathematics. 126: 273-280. DOI: 10.1016/0012-365X(94)90271-2  0.551
1994 Ding GL, Seymour PD, Winkler P. Bounding the vertex cover number of a hypergraph Combinatorica. 14: 23-34. DOI: 10.1007/Bf01305948  0.339
1994 Seymour PD, Thomas R. Call routing and the ratcatcher Combinatorica. 14: 217-241. DOI: 10.1007/Bf01215352  0.364
1994 Robertson N, Seymour P, Thomas R. Quickly excluding a planar graph Journal of Combinatorial Theory, Series B. 62: 323-348. DOI: 10.1006/Jctb.1994.1073  0.663
1994 Schrijver A, Seymour PD. Packing Odd Paths Journal of Combinatorial Theory, Series B. 62: 280-288. DOI: 10.1006/Jctb.1994.1070  0.469
1994 Seymour PD. A Note on Hyperplane Generation Journal of Combinatorial Theory, Series B. 61: 88-91. DOI: 10.1006/Jctb.1994.1033  0.325
1994 Robertson N, Seymour PD. Graph Minors. XI. Circuits on a Surface Journal of Combinatorial Theory, Series B. 60: 72-106. DOI: 10.1006/Jctb.1994.1007  0.494
1994 Dahlhaus E, Johnson DS, Papadimitriou CH, Seymour PD, Yannakakis M. Complexity of multiterminal cuts Siam Journal On Computing. 23: 864-894.  0.43
1993 Robertson N, Seymour PD, Thomas R. Linkless embeddings of graphs in 3-space Bulletin of the American Mathematical Society. 28: 84-89. DOI: 10.1090/S0273-0979-1993-00335-5  0.636
1993 Seymour PD, Thomas R. Excluding infinite trees Transactions of the American Mathematical Society. 335: 597-630. DOI: 10.1090/S0002-9947-1993-1079058-6  0.528
1993 Robertson N, Seymour PD, Thomas R. Hadwiger's conjecture for K 6 -free graphs Combinatorica. 13: 279-361. DOI: 10.1007/Bf01202354  0.582
1993 Ding GL, Schrijver A, Seymour PD. Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle Journal of Combinatorial Theory, Series B. 58: 40-45. DOI: 10.1006/Jctb.1993.1029  0.553
1993 Seymour PD, Thomas R. Graph Searching and a Min-Max Theorem for Tree-Width Journal of Combinatorial Theory, Series B. 58: 22-33. DOI: 10.1006/Jctb.1993.1027  0.582
1992 Ding G, Schrijver A, Seymour PD. Disjoint paths in a planar graph—a general theorem Siam Journal On Discrete Mathematics. 5: 112-116. DOI: 10.1137/0405009  0.46
1992 Robertson N, Seymour PD, Thomas R. Excluding subdivisions of infinite cliques Transactions of the American Mathematical Society. 332: 211-223. DOI: 10.1090/S0002-9947-1992-1079057-3  0.522
1992 de Graaf M, Schrijver A, Seymour PD. Directed triangles in directed graphs Discrete Mathematics. 110: 279-282. DOI: 10.1016/0012-365X(92)90719-V  0.516
1992 Kahn J, Seymour PD. A fractional version of the Erdo{combining double acute accent}s-Faber-Lovász conjecture Combinatorica. 12: 155-160. DOI: 10.1007/Bf01204719  0.408
1992 Dahlhaus E, Johnson DS, Papadimitriou CH, Seymour PD, Yannakakis M. Complexity of multiway cuts Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 241-251.  0.429
1991 Bienstock D, Seymour P. Monotonicity in graph searching Journal of Algorithms. 12: 239-245. DOI: 10.1016/0196-6774(91)90003-H  0.601
1991 Schrijver A, Seymour PD. A simpler proof and a generalization of the zero-trees theorem Journal of Combinatorial Theory, Series A. 58: 301-305. DOI: 10.1016/0097-3165(91)90063-M  0.493
1991 Bienstock D, Robertson N, Seymour P, Thomas R. Quickly excluding a forest Journal of Combinatorial Theory, Series B. 52: 274-283. DOI: 10.1016/0095-8956(91)90068-U  0.361
1991 Robertson N, Seymour PD. Graph minors. X. Obstructions to tree-decomposition Journal of Combinatorial Theory, Series B. 52: 153-190. DOI: 10.1016/0095-8956(91)90061-N  0.597
1991 Seymour P, Thomas R. An end-faithful spanning tree counterexample Discrete Mathematics. 95: 321-330. DOI: 10.1016/0012-365X(91)90344-2  0.54
1991 Robertson N, Seymour P, Thomas R. Excluding infinite minors Discrete Mathematics. 95: 303-319. DOI: 10.1016/0012-365X(91)90343-Z  0.572
1991 Seymour PD. Directed circuits on a torus Combinatorica. 11: 261-273. DOI: 10.1007/Bf01205078  0.402
1990 Alon NM, Seymour PD, Thomas R. A separator theorem for nonplanar graphs Journal of the American Mathematical Society. 3: 801-808. DOI: 10.1090/S0894-0347-1990-1065053-0  0.601
1990 Robertson N, Seymour PD. Graph minors. VIII. A kuratowski theorem for general surfaces Journal of Combinatorial Theory, Series B. 48: 255-288. DOI: 10.1016/0095-8956(90)90121-F  0.626
1990 Robertson N, Seymour PD. Graph minors. IV. Tree-width and well-quasi-ordering Journal of Combinatorial Theory, Series B. 48: 227-254. DOI: 10.1016/0095-8956(90)90120-O  0.581
1990 Robertson N, Seymour PD. Graph minors. IX. Disjoint crossed paths Journal of Combinatorial Theory, Series B. 49: 40-77. DOI: 10.1016/0095-8956(90)90063-6  0.584
1990 Seymour PD. Colouring series-parallel graphs Combinatorica. 10: 379-392. DOI: 10.1007/Bf02128672  0.613
1990 Marcotte O, Seymour PD. Extending an edge-coloring Journal of Graph Theory. 14: 565-573. DOI: 10.1002/Jgt.3190140508  0.548
1989 Chung FRK, Seymour PD. Graphs with Small Bandwidth and Cutwidth Annals of Discrete Mathematics. 43: 113-119. DOI: 10.1016/0012-365X(89)90083-6  0.541
1989 Alon NM, Seymour PD. A counterexample to the rank-coloring conjecture Journal of Graph Theory. 13: 523-525. DOI: 10.1002/Jgt.3190130413  0.495
1988 Chung FRK, Füredi Z, Graham RL, Seymour P. On induced subgraphs of the cube Journal of Combinatorial Theory, Series A. 49: 180-187. DOI: 10.1016/0097-3165(88)90034-9  0.518
1988 Robertson N, Seymour PD. Graph minors. VII. Disjoint paths on a surface Journal of Combinatorial Theory, Series B. 45: 212-254. DOI: 10.1016/0095-8956(88)90070-6  0.5
1987 Seymour P, Thomassen C. Characterization of even directed graphs Journal of Combinatorial Theory, Series B. 42: 36-45. DOI: 10.1016/0095-8956(87)90061-X  0.438
1987 Alon N, Kleitman DJ, Pomerance C, Saks M, Seymour P. The smallest n-uniform hypergraph with positive discrepancy Combinatorica. 7: 151-160. DOI: 10.1007/Bf02579446  0.379
1987 Alon N, Kahn J, Seymour PD. Large induced degenerate subgraphs Graphs and Combinatorics. 3: 203-211. DOI: 10.1007/Bf01788542  0.585
1987 Alon N, Kleitman D, Thomassen C, Saks M, Seymour P. Subgraphs of large connectivity and chromatic number in graphs of large chromatic number Journal of Graph Theory. 11: 367-371. DOI: 10.1002/Jgt.3190110311  0.491
1986 Seymour PD. Triples in matroid circuits The Journal of Combinatorics. 7: 177-185. DOI: 10.1016/S0195-6698(86)80044-0  0.467
1986 Seymour PD. Adjacency in binary matroids The Journal of Combinatorics. 7: 171-176. DOI: 10.1016/S0195-6698(86)80043-9  0.401
1986 Robertson N, Seymour PD. Graph minors. II. Algorithmic aspects of tree-width Journal of Algorithms. 7: 309-322. DOI: 10.1016/0196-6774(86)90023-4  0.587
1986 Robertson N, Seymour PD. Graph minors. VI. Disjoint paths across a disc Journal of Combinatorial Theory, Series B. 41: 115-138. DOI: 10.1016/0095-8956(86)90031-6  0.622
1986 Robertson N, Seymour PD. Graph minors. V. Excluding a planar graph Journal of Combinatorial Theory, Series B. 41: 92-114. DOI: 10.1016/0095-8956(86)90030-4  0.653
1985 Robertson N, Seymour PD. Disjoint Paths—A Survey Siam Journal On Algebraic and Discrete Methods. 6: 300-305. DOI: 10.1137/0606030  0.655
1984 Seymour PD, Robertson N. Some New Results on the Well-Quasi-Ordering of Graphs North-Holland Mathematics Studies. 99: 343-354. DOI: 10.1016/S0304-0208(08)73830-1  0.558
1984 Asano T, Nishizeki T, Seymour PD. A note on nongraphic matroids Journal of Combinatorial Theory, Series B. 37: 290-293. DOI: 10.1016/0095-8956(84)90062-5  0.365
1984 Robertson N, Seymour PD. Graph minors. III. Planar tree-width Journal of Combinatorial Theory, Series B. 36: 49-64. DOI: 10.1016/0095-8956(84)90013-3  0.643
1984 Seymour PD, Weaver RW. A generalization of chordal graphs Journal of Graph Theory. 8: 241-251. DOI: 10.1002/Jgt.3190080206  0.618
1983 Robertson N, Seymour PD. Graph minors. I. Excluding a forest Journal of Combinatorial Theory, Series B. 35: 39-61. DOI: 10.1016/0095-8956(83)90079-5  0.623
1982 Seymour PD. On the points-lines-planes conjecture Journal of Combinatorial Theory, Series B. 33: 17-26. DOI: 10.1016/0095-8956(82)90054-5  0.309
1982 Seymour PD. Packing nearly-disjoint sets Combinatorica. 2: 91-97. DOI: 10.1007/Bf02579285  0.377
1981 Seymour PD. On Odd Cuts and Plane Multicommodity Flows Proceedings of the London Mathematical Society. 178-192. DOI: 10.1112/plms/s3-42.1.178  0.45
1981 Seymour PD, Walton PN. Detecting Matroid Minors Journal of the London Mathematical Society. 193-203. DOI: 10.1112/Jlms/S2-23.2.193  0.332
1981 Seymour PD. Matroids and Multicommodity Flows European Journal of Combinatorics. 2: 257-290. DOI: 10.1016/S0195-6698(81)80033-9  0.476
1981 Seymour PD. On Tutte's extension of the four-colour problem Journal of Combinatorial Theory, Series B. 31: 82-94. DOI: 10.1016/S0095-8956(81)80013-5  0.439
1981 Okamura H, Seymour PD. Multicommodity flows in planar graphs Journal of Combinatorial Theory, Series B. 31: 75-81. DOI: 10.1016/S0095-8956(81)80012-3  0.507
1981 Seymour PD. Nowhere-zero 6-flows Journal of Combinatorial Theory, Series B. 30: 130-135. DOI: 10.1016/0095-8956(81)90058-7  0.303
1981 Seymour PD. Even circuits in planar graphs Journal of Combinatorial Theory, Series B. 31: 327-338. DOI: 10.1016/0095-8956(81)90034-4  0.595
1981 Seymour PD. Recognizing graphic matroids Combinatorica. 1: 75-78. DOI: 10.1007/Bf02579179  0.364
1980 Seymour PD. On Tutte's Characterization of Graphic Matroids Annals of Discrete Mathematics. 8: 83-90. DOI: 10.1016/S0167-5060(08)70855-0  0.323
1980 Seymour PD. FOUR-TERMINUS FLOWS Networks. 10: 79-86. DOI: 10.1002/Net.3230100108  0.399
1978 Seymour PD, Welsh DJA. Percolation Probabilities on the Square Lattice Annals of Discrete Mathematics. 3: 227-245. DOI: 10.1016/S0167-5060(08)70509-0  0.367
1978 Seymour PD. A two-commodity cut theorem Discrete Mathematics. 23: 177-181. DOI: 10.1016/0012-365X(78)90116-4  0.491
1978 Seymour PD. Counterexample to a conjecture of Jeurissen Discrete Mathematics. 24: 315. DOI: 10.1016/0012-365X(78)90103-6  0.428
1977 Seymour PD. A note on the production of matroid minors Journal of Combinatorial Theory, Series B. 22: 289-295. DOI: 10.1016/0095-8956(77)90077-6  0.552
1977 Seymour PD. The matroids with the max-flow min-cut property Journal of Combinatorial Theory, Series B. 23: 189-222. DOI: 10.1016/0095-8956(77)90031-4  0.433
1976 Seymour PD. The forbidden minors of binary clutters Journal of the London Mathematical Society. 356-360. DOI: 10.1112/Jlms/S2-12.3.356  0.309
1974 Seymour PD. On the two-colouring of hypergraphs Quarterly Journal of Mathematics. 25: 303-311. DOI: 10.1093/Qmath/25.1.303  0.311
Show low-probability matches.