default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul D. Seymour
Person information
- affiliation: Princeton University, Department of Mathematics, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j239]Jacob Fox, Tung Nguyen, Alex D. Scott, Paul D. Seymour:
Induced subgraph density. II. Sparse and dense sets in cographs. Eur. J. Comb. 124: 104075 (2025)- 2024
- [j238]Eli Berger, Paul D. Seymour:
Bounded-Diameter Tree-Decompositions. Comb. 44(3): 659-674 (2024) - [j237]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property. Eur. J. Comb. 115: 103786 (2024) - [j236]Tung Nguyen, Alexander Scott, Paul D. Seymour, Stéphan Thomassé:
Clique covers of H-free graphs. Eur. J. Comb. 118: 103909 (2024) - [j235]Tung Nguyen, Alex Scott
, Paul D. Seymour:
A Note on the Gyárfás-Sumner Conjecture. Graphs Comb. 40(2): 33 (2024) - [j234]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Bipartite graphs with no K6 minor. J. Comb. Theory B 164: 68-104 (2024) - [j233]Tung Nguyen, Alex D. Scott, Paul D. Seymour:
Induced paths in graphs without anticomplete cycles. J. Comb. Theory B 164: 321-339 (2024) - [j232]Alex D. Scott, Paul D. Seymour:
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph. J. Comb. Theory B 164: 473-491 (2024) - [j231]Tung Nguyen, Alex D. Scott, Paul D. Seymour:
On a problem of El-Zahar and Erdős. J. Comb. Theory B 165: 211-222 (2024) - [j230]Linda Cook, Jake Horsfield, Myriam Preissmann, Cléophée Robin, Paul D. Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vuskovic:
Graphs with all holes the same length. J. Comb. Theory B 168: 96-158 (2024) - [j229]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced Subgraphs of Bounded Treewidth and the Container Method. SIAM J. Comput. 53(3): 624-647 (2024) - [j228]Alex D. Scott, Paul D. Seymour, Sophie Theresa Spirkl:
Pure Pairs. IX. Transversal Trees. SIAM J. Discret. Math. 38(1): 645-667 (2024) - [j227]Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte:
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs. SIAM J. Discret. Math. 38(1): 845-856 (2024) - 2023
- [j226]Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs. V. Excluding Some Long Subdivision. Comb. 43(3): 571-593 (2023) - [j225]Alex Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. Comb. 43(5): 845-852 (2023) - [j224]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number VI. Adding a four-vertex path. Eur. J. Comb. 110: 103710 (2023) - [j223]Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. IV. Trees in bipartite graphs. J. Comb. Theory B 161: 120-146 (2023) - [j222]Maria Chudnovsky, Paul D. Seymour:
Even-hole-free graphs still have bisimplicial vertices. J. Comb. Theory B 161: 331-381 (2023) - [j221]Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix. J. Comb. Theory B 161: 437-464 (2023) - [j220]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Strengthening Rödl's theorem. J. Comb. Theory B 163: 256-271 (2023) - [j219]Alexander D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. J. Graph Theory 102(3): 458-471 (2023) - [j218]Maria Chudnovsky, Paul D. Seymour:
Proof of a conjecture of Plummer and Zha. J. Graph Theory 103(3): 437-450 (2023) - [j217]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number VII. Disjoint holes. J. Graph Theory 104(3): 499-515 (2023) - [i15]Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte:
Cops and robbers on P5-free graphs. CoRR abs/2301.13175 (2023) - 2022
- [j216]Maria Chudnovsky, Patrick Hompe, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Concatenating Bipartite Graphs. Electron. J. Comb. 29(2) (2022) - [j215]Linda Cook, Paul D. Seymour:
Detecting a long even hole. Eur. J. Comb. 104: 103537 (2022) - [j214]Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number II: Excluding a star-forest. J. Graph Theory 101(2): 318-322 (2022) - [j213]Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number. III. Excluding a double star. J. Graph Theory 101(2): 323-340 (2022) - [j212]Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs VI: Excluding an Ordered Tree. SIAM J. Discret. Math. 36(1): 170-187 (2022) - 2021
- [j211]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Detecting a Long Odd Hole. Comb. 41(1): 1-30 (2021) - [j210]Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs. II. Excluding All Subdivisions of A Graph. Comb. 41(3): 379-405 (2021) - [j209]Maria Chudnovsky, Cemil Dibek, Paul D. Seymour:
New examples of minimal non-strongly-perfect graphs. Discret. Math. 344(5): 112334 (2021) - [j208]Eli Berger, Paul D. Seymour, Sophie Spirkl:
Finding an induced path that is not a shortest path. Discret. Math. 344(7): 112398 (2021) - [j207]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
A note on simplicial cliques. Discret. Math. 344(9): 112470 (2021) - [j206]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings. J. Comb. Theory B 150: 195-243 (2021) - [j205]Maria Chudnovsky, Paul D. Seymour:
Erdős-Hajnal for cap-free graphs. J. Comb. Theory B 151: 417-434 (2021) - [j204]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Finding a Shortest Odd Hole. ACM Trans. Algorithms 17(2): 13:1-13:21 (2021) - [c18]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. SODA 2021: 1948-1964 - 2020
- [j203]Paul D. Seymour, Sophie Spirkl:
Short Directed Cycles in Bipartite Digraphs. Comb. 40(4): 575-599 (2020) - [j202]Maria Chudnovsky, Linda Cook, Paul D. Seymour:
Excluding the fork and antifork. Discret. Math. 343(5): 111786 (2020) - [j201]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XIII. New brooms. Eur. J. Comb. 84 (2020) - [j200]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Detecting an Odd Hole. J. ACM 67(1): 5:1-5:12 (2020) - [j199]Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. J. Comb. Theory, Ser. B 140: 84-97 (2020) - [j198]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture. J. Comb. Theory B 142: 43-55 (2020) - [j197]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory B 142: 374-375 (2020) - [j196]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. VI. Banana trees. J. Comb. Theory B 145: 487-510 (2020) - [j195]Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95(3): 315-340 (2020) - [j194]Alex Scott, Paul D. Seymour:
A survey of χ-boundedness. J. Graph Theory 95(3): 473-504 (2020) - [i14]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. CoRR abs/2003.05185 (2020)
2010 – 2019
- 2019
- [j193]Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39(5): 983-991 (2019) - [j192]Alex D. Scott, Paul D. Seymour:
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue. Comb. 39(5): 1105-1132 (2019) - [j191]Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood:
Clustered Colouring in Minor-Closed Classes. Comb. 39(6): 1387-1412 (2019) - [j190]Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth Six Cubic Graphs Have Petersen Minors. Comb. 39(6): 1413-1423 (2019) - [j189]Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267: 184-189 (2019) - [j188]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XI. Orientations. Eur. J. Comb. 76: 53-61 (2019) - [j187]Ron Aharoni, Eli Berger, Maria Chudnovsky, David M. Howard, Paul D. Seymour:
Large rainbow matchings in general graphs. Eur. J. Comb. 79: 222-227 (2019) - [j186]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Disjoint paths in unions of tournaments. J. Comb. Theory B 135: 238-255 (2019) - [j185]Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl:
Caterpillars in Erdős-Hajnal. J. Comb. Theory B 136: 33-43 (2019) - [j184]Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluded minors in cubic graphs. J. Comb. Theory B 138: 219-285 (2019) - [j183]Bruce A. Reed, Alex Scott, Paul D. Seymour:
Near-domination in graphs. J. Comb. Theory A 165: 392-407 (2019) - [j182]Alex Scott, Paul D. Seymour, David R. Wood:
Bad news for chordal partitions. J. Graph Theory 90(1): 5-12 (2019) - [j181]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XII. Distant stars. J. Graph Theory 92(3): 237-254 (2019) - 2018
- [j180]Maria Chudnovsky, Paul D. Seymour, Sophie Spirkl, Mingxian Zhong:
Triangle-free graphs with no six-vertex induced path. Discret. Math. 341(8): 2179-2196 (2018) - [j179]Maria Chudnovsky, Ringi Kim, Chun-Hung Liu, Paul D. Seymour, Stéphan Thomassé:
Domination in tournaments. J. Comb. Theory B 130: 98-113 (2018) - [j178]Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl:
Even pairs and prism corners in square-free Berge graphs. J. Comb. Theory B 131: 12-39 (2018) - [j177]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes. J. Comb. Theory B 132: 180-235 (2018) - [j176]Maria Chudnovsky, Frédéric Maffray, Paul D. Seymour, Sophie Spirkl:
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 133: 259-260 (2018) - [i13]Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl:
Caterpillars in Erdős-Hajnal. CoRR abs/1810.00811 (2018) - 2017
- [j175]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. Comb. 37(6): 1057-1072 (2017) - [j174]Stephan Kreutzer, Sang-il Oum, Paul D. Seymour, Dominic van der Zypen, David R. Wood:
Majority Colourings of Digraphs. Electron. J. Comb. 24(2): 2 (2017) - [j173]Alex Scott, Paul D. Seymour:
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths. Electron. J. Comb. 24(2): 2 (2017) - [j172]Dániel Marx, Paul D. Seymour, Paul Wollan:
Rooted grid minors. J. Comb. Theory B 122: 428-437 (2017) - [j171]Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. J. Comb. Theory B 122: 757-775 (2017) - [j170]Neil Robertson, Paul D. Seymour, Robin Thomas:
Cyclically five-connected cubic graphs. J. Comb. Theory B 125: 132-167 (2017) - [i12]Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. CoRR abs/1707.03747 (2017) - 2016
- [j169]Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. J. Comb. Theory B 116: 208-218 (2016) - [j168]Maria Chudnovsky, Gil Kalai, Eran Nevo, Isabella Novik, Paul D. Seymour:
Bipartite minors. J. Comb. Theory B 116: 219-228 (2016) - [j167]Paul D. Seymour:
Tree-chromatic number. J. Comb. Theory B 116: 229-237 (2016) - [j166]Maria Chudnovsky, Ringi Kim, Sang-il Oum, Paul D. Seymour:
Unavoidable induced subgraphs in large graphs with no homogeneous sets. J. Comb. Theory B 118: 1-12 (2016) - [j165]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures. J. Comb. Theory B 118: 109-128 (2016) - [j164]Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Three-edge-colouring doublecross cubic graphs. J. Comb. Theory B 119: 66-95 (2016) - [j163]Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul D. Seymour:
Disjoint dijoins. J. Comb. Theory B 120: 18-35 (2016) - [j162]Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. I. Odd holes. J. Comb. Theory B 121: 68-84 (2016) - [p1]Paul D. Seymour:
Hadwiger's Conjecture. Open Problems in Mathematics 2016: 417-437 - 2015
- [j161]Maria Chudnovsky, Paul D. Seymour:
Excluding paths and antipaths. Comb. 35(4): 389-412 (2015) - [j160]Pierre Aboulker, Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Wheel-free planar graphs. Eur. J. Comb. 49: 57-67 (2015) - [j159]Alexandra Ovetsky Fradkin, Paul D. Seymour:
Edge-disjoint paths in digraphs with bounded independence number. J. Comb. Theory B 110: 19-46 (2015) - [j158]Paul D. Seymour:
Criticality for multicommodity flows. J. Comb. Theory B 110: 136-179 (2015) - [j157]Alexander Leaf, Paul D. Seymour:
Tree-width and planar minors. J. Comb. Theory B 111: 38-53 (2015) - [j156]Ilhee Kim, Paul D. Seymour:
Tournament minors. J. Comb. Theory B 112: 138-153 (2015) - [j155]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. J. Comb. Theory B 115: 276-302 (2015) - [j154]Maria Chudnovsky, Katherine Edwards, Paul D. Seymour:
Edge-colouring eight-regular planar graphs. J. Comb. Theory B 115: 303-338 (2015) - [j153]Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour:
Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. 29(1): 297-308 (2015) - [j152]Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, Paul D. Seymour:
A Relative of Hadwiger's Conjecture. SIAM J. Discret. Math. 29(4): 2385-2388 (2015) - [i11]Neil Robertson, Paul D. Seymour, Robin Thomas:
Cyclically five-connected cubic graphs. CoRR abs/1503.02298 (2015) - [i10]Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluding A Grid Minor In Planar Digraphs. CoRR abs/1510.00473 (2015) - 2014
- [j151]Paul D. Seymour:
Proof of a conjecture of Bowlin and Brin on four-colouring triangulations. Eur. J. Comb. 38: 79-82 (2014) - [j150]Maria Chudnovsky, Paul D. Seymour:
Extending the Gyárfás-Sumner conjecture. J. Comb. Theory B 105: 11-16 (2014) - [j149]Maria Chudnovsky, Paul D. Seymour:
Rao's degree sequence conjecture. J. Comb. Theory B 105: 44-92 (2014) - [j148]Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Excluding pairs of graphs. J. Comb. Theory B 106: 15-29 (2014) - [j147]Krzysztof Choromanski, Maria Chudnovsky, Paul D. Seymour:
Tournaments with near-linear transitive subsets. J. Comb. Theory B 109: 228-249 (2014) - [i9]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Reducibility in the Four-Color Theorem. CoRR abs/1401.6481 (2014) - [i8]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Discharging cartwheels. CoRR abs/1401.6485 (2014) - [i7]Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth six cubic graphs have Petersen minors. CoRR abs/1405.0533 (2014) - 2013
- [j146]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. J. Comb. Theory B 103(1): 1-20 (2013) - [j145]Alexandra Ovetsky Fradkin, Paul D. Seymour:
Tournament pathwidth and topological containment. J. Comb. Theory B 103(3): 374-384 (2013) - [j144]Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Detecting an induced net subdivision. J. Comb. Theory B 103(5): 630-641 (2013) - [j143]Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
A counterexample to a conjecture of Schwartz. Soc. Choice Welf. 40(3): 739-743 (2013) - [j142]Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour:
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. SIAM J. Discret. Math. 27(1): 95-108 (2013) - [i6]Maria Chudnovsky, Zdenek Dvorák, Tereza Klimosová, Paul D. Seymour:
Immersion in four-edge-connected graphs. CoRR abs/1308.0827 (2013) - [i5]Maria Chudnovsky, Paul D. Seymour, Nicolas Trotignon:
Detecting an induced net subdivision. CoRR abs/1309.1960 (2013) - 2012
- [j141]Maria Chudnovsky, Paul D. Seymour:
Packing seagulls. Comb. 32(3): 251-282 (2012) - [j140]Maria Chudnovsky, Sang-il Oum, Paul D. Seymour:
Finding minimum clique capacity. Comb. 32(3): 283-287 (2012) - [j139]Maria Chudnovsky, Paul D. Seymour:
Perfect matchings in planar cubic graphs. Comb. 32(4): 403-424 (2012) - [j138]Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour:
Tournament immersion and cutwidth. J. Comb. Theory B 102(1): 93-101 (2012) - [j137]Maria Chudnovsky, Paul D. Seymour:
Three-colourable perfect graphs without even pairs. J. Comb. Theory B 102(2): 363-394 (2012) - [j136]Neil Robertson, Paul D. Seymour:
Graph Minors. XXII. Irrelevant vertices in linkage problems. J. Comb. Theory B 102(2): 530-563 (2012) - [j135]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. VII. Quasi-line graphs. J. Comb. Theory B 102(6): 1267-1294 (2012) - [j134]Maria Chudnovsky, Paul D. Seymour:
Growing Without Cloning. SIAM J. Discret. Math. 26(2): 860-880 (2012) - [j133]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. IEEE/ACM Trans. Netw. 20(1): 163-176 (2012) - [i4]Ilhee Kim, Paul D. Seymour:
Tournament Minors. CoRR abs/1206.3135 (2012) - [i3]Maria Chudnovsky, Katherine Edwards, Paul D. Seymour:
Edge-colouring eight-regular planar graphs. CoRR abs/1209.1176 (2012) - [i2]Maria Chudnovsky, Katherine Edwards, Ken-ichi Kawarabayashi, Paul D. Seymour:
Edge-colouring seven-regular planar graphs. CoRR abs/1210.7349 (2012) - 2011
- [j132]Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour:
The edge-density for K2, t minors. J. Comb. Theory B 101(1): 18-46 (2011) - [j131]Maria Chudnovsky, Paul D. Seymour:
A well-quasi-order for tournaments. J. Comb. Theory B 101(1): 47-53 (2011) - [i1]Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour:
A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs. CoRR abs/1109.2112 (2011) - 2010
- [j130]Maria Chudnovsky, Paul D. Seymour:
The three-in-a-tree problem. Comb. 30(4): 387-417 (2010) - [j129]Paul D. Seymour, Blair D. Sullivan:
Counting paths in digraphs. Eur. J. Comb. 31(3): 961-975 (2010) - [j128]Neil Robertson, Paul D. Seymour:
Graph minors XXIII. Nash-Williams' immersion conjecture. J. Comb. Theory B 100(2): 181-205 (2010) - [j127]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
K4-free graphs with no odd holes. J. Comb. Theory B 100(3): 313-331 (2010) - [j126]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs VI. Colouring. J. Comb. Theory B 100(6): 560-572 (2010) - [c17]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. INFOCOM 2010: 2213-2221 - [c16]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. S3@MobiCom 2010: 17-20
2000 – 2009
- 2009
- [j125]Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory B 99(1): 20-29 (2009) - [j124]Maria Chudnovsky, Paul D. Seymour:
Even pairs in Berge graphs. J. Comb. Theory B 99(2): 370-377 (2009) - [j123]Neil Robertson, Paul D. Seymour:
Graph minors. XXI. Graphs with unique linkages. J. Comb. Theory B 99(3): 583-616 (2009) - 2008
- [j122]Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan:
Cycles in dense digraphs. Comb. 28(1): 1-18 (2008) - [j121]Maria Chudnovsky, Paul D. Seymour:
Solution of three problems of Cornuéjols. J. Comb. Theory B 98(1): 116-135 (2008) - [j120]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. II. Non-orientable prismatic graphs. J. Comb. Theory B 98(2): 249-290 (2008) - [j119]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. III. Circular interval graphs. J. Comb. Theory B 98(4): 812-834 (2008) - [j118]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. IV. Decomposition theorem. J. Comb. Theory B 98(5): 839-938 (2008) - [j117]Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour:
Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory B 98(6): 1119-1164 (2008) - [j116]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. V. Global structure. J. Comb. Theory B 98(6): 1373-1410 (2008) - 2007
- [j115]Maria Chudnovsky, Paul D. Seymour:
The roots of the independence polynomial of a clawfree graph. J. Comb. Theory B 97(3): 350-357 (2007) - [j114]Sang-il Oum, Paul D. Seymour:
Testing branch-width. J. Comb. Theory B 97(3): 385-393 (2007) - [j113]Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. I. Orientable prismatic graphs. J. Comb. Theory B 97(6): 867-903 (2007) - [c15]Maria Chudnovsky, Paul D. Seymour:
Testing for a theta. SODA 2007: 595-598 - 2006
- [j112]Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour:
Packing Non-Zero A-Paths In Group-Labelled Graphs. Comb. 26(5): 521-532 (2006) - [j111]Alexander Schrijver, Paul D. Seymour:
Solution of two fractional packing problems of Lovász. Discret. Math. 306(10-11): 973-978 (2006) - [j110]Paul D. Seymour:
Disjoint paths in graphs. Discret. Math. 306(10-11): 979-991 (2006) - [j109]Sang-il Oum, Paul D. Seymour:
Approximating clique-width and branch-width. J. Comb. Theory B 96(4): 514-528 (2006) - [j108]Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan:
Proper minor-closed families are small. J. Comb. Theory B 96(5): 754-757 (2006) - [c14]Sang-il Oum, Paul D. Seymour:
Certifying large branch-width. SODA 2006: 810-813 - 2005
- [j107]Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic:
Recognizing Berge Graphs. Comb. 25(2): 143-186 (2005) - [j106]Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour:
Detecting even holes. J. Graph Theory 48(2): 85-111 (2005) - [c13]Maria Chudnovsky, Paul D. Seymour:
The structure of claw-free graphs. BCC 2005: 153-171 - 2004
- [j105]Bruce A. Reed, Paul D. Seymour:
Hadwiger's conjecture for line graphs. Eur. J. Comb. 25(6): 873-876 (2004) - [j104]Neil Robertson, Paul D. Seymour:
Graph Minors. XIX. Well-quasi-ordering on a surface. J. Comb. Theory B 90(2): 325-385 (2004) - [j103]Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory B 91(1): 25-41 (2004) - [j102]Neil Robertson, Paul D. Seymour:
Graph Minors. XX. Wagner's conjecture. J. Comb. Theory B 92(2): 325-357 (2004) - 2003
- [j101]William J. Cook, Paul D. Seymour:
Tour Merging via Branch-Decomposition. INFORMS J. Comput. 15(3): 233-248 (2003) - [j100]Matt DeVos, Paul D. Seymour:
Extending partial 3-colourings in a planar graph. J. Comb. Theory B 88(2): 219-225 (2003) - [j99]Neil Robertson, Paul D. Seymour:
Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory B 89(1): 43-76 (2003) - [j98]Neil Robertson, Paul D. Seymour:
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. J. Comb. Theory B 89(1): 77-108 (2003) - [j97]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003) - 2002
- [j96]Joan P. Hutchinson, R. Bruce Richter, Paul D. Seymour:
Colouring Eulerian Triangulations. J. Comb. Theory B 84(2): 225-239 (2002) - [j95]Bojan Mohar, Paul D. Seymour:
Coloring Locally Bipartite Graphs on Surfaces. J. Comb. Theory B 84(2): 301-310 (2002) - 2001
- [j94]Tamra Carpenter, Martin I. Eiger, David Shallcross, Paul D. Seymour:
Node Placement and Sizing for Copper Broadband Access Networks. Ann. Oper. Res. 106(1-4): 199-228 (2001) - [j93]Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
Directed Tree-Width. J. Comb. Theory B 82(1): 138-154 (2001) - [j92]Guoli Ding, Thor Johnson, Paul D. Seymour:
Spanning trees with many leaves. J. Graph Theory 37(4): 189-197 (2001) - 2000
- [j91]Noga Alon, Michael Krivelevich, Paul D. Seymour:
Long cycles in critical graphs. J. Graph Theory 35(3): 193-196 (2000)
1990 – 1999
- 1999
- [j90]Neil Robertson, Paul D. Seymour:
Graph Minors: XVII. Taming a Vortex. J. Comb. Theory B 77(1): 162-210 (1999) - [j89]Alexander Schrijver, Paul D. Seymour, Peter Winkler:
The Ring Loading Problem. SIAM Rev. 41(4): 777-791 (1999) - 1998
- [j88]Paul D. Seymour, Klaus Truemper:
A Petersen on a Pentagon. J. Comb. Theory B 72(1): 63-79 (1998) - [j87]Paul D. Seymour:
A Note on List Arboricity. J. Comb. Theory B 72(1): 150-151 (1998) - [j86]Bruce A. Reed, Paul D. Seymour:
Fractional Colouring and Hadwiger's Conjecture. J. Comb. Theory B 74(2): 147-152 (1998) - [j85]Alexander Schrijver, Paul D. Seymour, Peter Winkler:
The Ring Loading Problem. SIAM J. Discret. Math. 11(1): 1-14 (1998) - [c12]Siddhartha R. Dalal, Ashish Jain, Gardner C. Patton, Manish Rathi, Paul D. Seymour:
AETGSM Web: A Web Based Service for Automatic Efficient Test Generation from Functional Requirements. WIFT 1998: 84-85 - 1997
- [j84]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
The Four-Colour Theorem. J. Comb. Theory B 70(1): 2-44 (1997) - [j83]Neil Robertson, Paul D. Seymour, Robin Thomas:
Tutte's Edge-Colouring Conjecture. J. Comb. Theory B 70(1): 166-183 (1997) - [j82]Paul D. Seymour:
Two Chromatic Polynomial Conjectures. J. Comb. Theory B 70(1): 184-196 (1997) - [c11]William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas:
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405 - 1996
- [j81]Paul D. Seymour:
Packing Circuits in Eulerian Digraphs. Comb. 16(2): 223-231 (1996) - [j80]Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas:
Packing Directed Circuits. Comb. 16(4): 535-554 (1996) - [j79]Neil Robertson, Paul D. Seymour:
Graph Minors: XV. Giant Steps. J. Comb. Theory, Ser. B 68(1): 112-148 (1996) - [j78]Zhicheng Gao, R. Bruce Richter, Paul D. Seymour:
Irreducible Triangulations of Surfaces. J. Comb. Theory, Ser. B 68(2): 206-217 (1996) - [j77]Paul D. Seymour, Robin Thomas:
Uniqueness of highly representative surface embeddings. J. Graph Theory 23(4): 337-349 (1996) - [c10]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575 - 1995
- [j76]Paul D. Seymour:
Packing Directed Circuits Fractionally. Comb. 15(2): 281-288 (1995) - [j75]Neil Robertson, Paul D. Seymour:
Graph Minors .XIII. The Disjoint Paths Problem. J. Comb. Theory B 63(1): 65-110 (1995) - [j74]Neil Robertson, Paul D. Seymour, Robin Thomas:
Kuratowski Chains. J. Comb. Theory B 64(2): 127-154 (1995) - [j73]Neil Robertson, Paul D. Seymour, Robin Thomas:
Petersen Family Minors. J. Comb. Theory B 64(2): 155-184 (1995) - [j72]Neil Robertson, Paul D. Seymour, Robin Thomas:
Sachs' Linkless Embedding Conjecture. J. Comb. Theory B 64(2): 185-227 (1995) - [j71]Neil Robertson, Paul D. Seymour:
Graph Minors .XII. Distance on a Surface. J. Comb. Theory B 64(2): 240-272 (1995) - [j70]Neil Robertson, Paul D. Seymour:
Graph Minors .XIV. Extending an Embedding. J. Comb. Theory B 65(1): 23-50 (1995) - [e3]William J. Cook, László Lovász, Paul D. Seymour:
Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20, DIMACS/AMS 1995, ISBN 978-0-8218-0239-7 [contents] - 1994
- [j69]Guoli Ding, Paul D. Seymour, Peter Winkler:
Bounding the Vertex Cover Number of a Hypergraph. Comb. 14(1): 23-34 (1994) - [j68]Paul D. Seymour, Robin Thomas:
Call Routing and the Ratcatcher. Comb. 14(2): 217-241 (1994) - [j67]R. Bruce Richter, Paul D. Seymour, Jozef Sirán:
Circular embeddings of planar graphs in nonspherical surfaces. Discret. Math. 126(1-3): 273-280 (1994) - [j66]Neil Robertson, Paul D. Seymour:
Graph Minors. XI. Circuits on a Surface. J. Comb. Theory B 60(1): 72-106 (1994) - [j65]Paul D. Seymour:
A Note on Hyperplane Generation. J. Comb. Theory B 61(1): 88-91 (1994) - [j64]Alexander Schrijver, Paul D. Seymour:
Packing Odd Paths. J. Comb. Theory B 62(2): 280-288 (1994) - [j63]Neil Robertson, Paul D. Seymour, Robin Thomas:
Quickly Excluding a Planar Graph. J. Comb. Theory B 62(2): 323-348 (1994) - [j62]Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis:
The Complexity of Multiterminal Cuts. SIAM J. Comput. 23(4): 864-894 (1994) - [j61]Noga Alon, Paul D. Seymour, Robin Thomas:
Planar Separators. SIAM J. Discret. Math. 7(2): 184-193 (1994) - 1993
- [j60]Zoltán Füredi, Jeff Kahn, Paul D. Seymour:
On the fractional matching polytope of a hypergraph. Comb. 13(2): 167-180 (1993) - [j59]Neil Robertson, Paul D. Seymour, Robin Thomas:
Hadwiger's conjecture for K 6-free graphs. Comb. 13(3): 279-361 (1993) - [j58]Paul D. Seymour, Robin Thomas:
Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory B 58(1): 22-33 (1993) - [j57]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. J. Comb. Theory B 58(1): 40-45 (1993) - [e2]Neil Robertson, Paul D. Seymour:
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. Contemporary Mathematics 147, American Mathematical Society 1993, ISBN 0-8218-5160-8 [contents] - 1992
- [j56]Jeff Kahn, Paul D. Seymour:
A fractional version of the Erdös-Faber-Lovász conjecture. Comb. 12(2): 155-160 (1992) - [j55]Maurits de Graaf, Alexander Schrijver, Paul D. Seymour:
Directed triangles in directed graphs. Discret. Math. 110(1-3): 279-282 (1992) - [j54]Paul D. Seymour:
On secret-sharing matroids. J. Comb. Theory B 56(1): 69-73 (1992) - [j53]Guoli Ding, Alexander Schrijver, Paul D. Seymour:
Disjoint Paths in a Planar Graph - A General Theorem. SIAM J. Discret. Math. 5(1): 112-116 (1992) - [c9]Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis:
The Complexity of Multiway Cuts (Extended Abstract). STOC 1992: 241-251 - 1991
- [j52]Paul D. Seymour:
Directed circuits on a torus. Comb. 11(3): 261-273 (1991) - [j51]Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluding infinite minors. Discret. Math. 95(1-3): 303-319 (1991) - [j50]Paul D. Seymour, Robin Thomas:
An end-faithful spanning tree counterexample. Discret. Math. 95(1-3): 321-330 (1991) - [j49]Daniel Bienstock, Paul D. Seymour:
Monotonicity in Graph Searching. J. Algorithms 12(2): 239-245 (1991) - [j48]Neil Robertson, Paul D. Seymour:
Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory B 52(2): 153-190 (1991) - [j47]Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas:
Quickly excluding a forest. J. Comb. Theory B 52(2): 274-283 (1991) - [j46]Alexander Schrijver, Paul D. Seymour:
A simpler proof and a generalization of the zero-trees theorem. J. Comb. Theory A 58(2): 301-305 (1991) - [c8]Neil Robertson, Paul D. Seymour, Robin Thomas:
A survey of linkless embeddings. Graph Structure Theory 1991: 125-136 - [c7]Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour:
Finding disjoint trees in planar graphs in linear time. Graph Structure Theory 1991: 295-301 - [c6]Neil Robertson, Paul D. Seymour, Robin Thomas:
Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538 - [c5]Neil Robertson, Paul D. Seymour:
Excluding a graph with one crossing. Graph Structure Theory 1991: 669-675 - 1990
- [j45]Paul D. Seymour:
Colouring series-parallel graphs. Comb. 10(4): 379-392 (1990) - [j44]Neil Robertson, Paul D. Seymour:
Graph minors. IV. Tree-width and well-quasi-ordering. J. Comb. Theory B 48(2): 227-254 (1990) - [j43]Neil Robertson, Paul D. Seymour:
Graph minors. VIII. A kuratowski theorem for general surfaces. J. Comb. Theory B 48(2): 255-288 (1990) - [j42]Neil Robertson, Paul D. Seymour:
Graph minors. IX. Disjoint crossed paths. J. Comb. Theory B 49(1): 40-77 (1990) - [j41]Odile Marcotte, Paul D. Seymour:
Extending an edge-coloring. J. Graph Theory 14(5): 565-573 (1990) - [c4]Paul D. Seymour:
On Lehman's Width-Length Characterization. Polyhedral Combinatorics 1990: 107-118 - [c3]Alexander Schrijver, Paul D. Seymour:
Spanning Trees of Different Weights. Polyhedral Combinatorics 1990: 281- - [c2]Noga Alon, Paul D. Seymour, Robin Thomas:
A Separator Theorem for Graphs with an Excluded Minor and its Applications. STOC 1990: 293-299 - [e1]William J. Cook, Paul D. Seymour:
Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 1, DIMACS/AMS 1990, ISBN 978-0-8218-6591-0 [contents]
1980 – 1989
- 1989
- [j40]Fan R. K. Chung, Paul D. Seymour:
Graphs with small bandwidth and cutwidth. Discret. Math. 75(1-3): 113-119 (1989) - [j39]Noga Alon, Paul D. Seymour:
A counterexample to the rank-coloring conjecture. J. Graph Theory 13(4): 523-525 (1989) - 1988
- [j38]Fan R. K. Chung, D. J. Hajela, Paul D. Seymour:
Self-organizing Sequential Search and Hilbert's Inequalities. J. Comput. Syst. Sci. 36(2): 148-157 (1988) - [j37]Paul D. Seymour:
On the connectivity function of a matroid. J. Comb. Theory B 45(1): 25-30 (1988) - [j36]Neil Robertson, Paul D. Seymour:
Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory B 45(2): 212-254 (1988) - [j35]Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour:
On induced subgraphs of the cube. J. Comb. Theory A 49(1): 180-187 (1988) - 1987
- [j34]Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour:
The smallets n-uniform hypergraph with positive discrepancy. Comb. 7(2): 151-160 (1987) - [j33]Noga Alon, Jeff Kahn, Paul D. Seymour:
Large induced degenerate subgraphs. Graphs Comb. 3(1): 203-211 (1987) - [j32]Paul D. Seymour, Carsten Thomassen:
Characterization of even directed graphs. J. Comb. Theory B 42(1): 36-45 (1987) - [j31]Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour:
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. J. Graph Theory 11(3): 367-371 (1987) - 1986
- [j30]Paul D. Seymour:
Adjacency in Binary Matroids. Eur. J. Comb. 7(2): 171-176 (1986) - [j29]Paul D. Seymour:
Triples in Matroid Circuits. Eur. J. Comb. 7(2): 177-185 (1986) - [j28]Neil Robertson, Paul D. Seymour:
Graph Minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms 7(3): 309-322 (1986) - [j27]Neil Robertson, Paul D. Seymour:
Graph minors. V. Excluding a planar graph. J. Comb. Theory B 41(1): 92-114 (1986) - [j26]Neil Robertson, Paul D. Seymour:
Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory B 41(1): 115-138 (1986) - 1985
- [j25]D. J. Hajela, Paul D. Seymour:
Counting points in hypercubes and convolution measure algebras. Comb. 5(3): 205-214 (1985) - [j24]Paul D. Seymour:
Minors of 3-Connected Matroids. Eur. J. Comb. 6(4): 375-382 (1985) - [c1]Fan R. K. Chung, D. J. Hajela, Paul D. Seymour:
Self-Organizing Sequential Search and Hilbert's Inequalities. STOC 1985: 217-223 - 1984
- [j23]Neil Robertson, Paul D. Seymour:
Graph minors. III. Planar tree-width. J. Comb. Theory B 36(1): 49-64 (1984) - [j22]Takao Asano, Takao Nishizeki, Paul D. Seymour:
A note on nongraphic matroids. J. Comb. Theory B 37(3): 290-293 (1984) - [j21]Paul D. Seymour, R. W. Weaver:
A generalization of chordal graphs. J. Graph Theory 8(2): 241-251 (1984) - 1983
- [j20]Neil Robertson, Paul D. Seymour:
Graph minors. I. Excluding a forest. J. Comb. Theory B 35(1): 39-61 (1983) - 1982
- [j19]Paul D. Seymour:
Packing nearly-disjoint sets. Comb. 2(1): 91-97 (1982) - 1981
- [j18]Paul D. Seymour:
Reconizing graphic matroids. Comb. 1(1): 75-78 (1981) - [j17]Paul D. Seymour:
On minors of non-binary matroids. Comb. 1(4): 387-394 (1981) - [j16]Paul D. Seymour:
Matroids and Multicommodity Flows. Eur. J. Comb. 2(3): 257-290 (1981) - [j15]Paul D. Seymour:
Nowhere-zero 6-flows. J. Comb. Theory B 30(2): 130-135 (1981) - [j14]Paul D. Seymour:
Even circuits in planar graphs. J. Comb. Theory B 31(3): 327-338 (1981) - [j13]Haruko Okamura, Paul D. Seymour:
Multicommodity flows in planar graphs. J. Comb. Theory B 31(3): 75-81 (1981) - [j12]Paul D. Seymour:
On Tutte's extension of the four-colour problem. J. Comb. Theory B 31(3): 82-94 (1981) - 1980
- [j11]Paul D. Seymour:
Disjoint paths in graphs. Discret. Math. 29(3): 293-309 (1980) - [j10]Paul D. Seymour:
Packing and covering with matroid circuits. J. Comb. Theory B 28(2): 237-242 (1980) - [j9]Paul D. Seymour:
Decomposition of regular matroids. J. Comb. Theory B 28(3): 305-359 (1980) - [j8]Paul D. Seymour:
Four-terminus flows. Networks 10(1): 79-86 (1980)
1970 – 1979
- 1979
- [j7]Alexander Schrijver, Paul D. Seymour:
Solution of two fractional packing problems of lovász. Discret. Math. 26(2): 177-184 (1979) - [j6]Paul D. Seymour:
Matroid representation over GF(3). J. Comb. Theory B 26(2): 159-173 (1979) - [j5]Paul D. Seymour:
A short proof of the two-commodity flow theorem. J. Comb. Theory B 26(3): 370-371 (1979) - 1978
- [j4]Paul D. Seymour:
A two-commodity cut theorem. Discret. Math. 23(2): 177-181 (1978) - [j3]Paul D. Seymour:
Counterexample to a conjecture of Jeurissen. Discret. Math. 24(3): 315 (1978) - 1977
- [j2]Paul D. Seymour:
A note on the production of matroid minors. J. Comb. Theory B 22(3): 289-295 (1977) - [j1]Paul D. Seymour:
The matroids with the max-flow min-cut property. J. Comb. Theory B 23(2-3): 189-222 (1977)
Coauthor Index
[j237] [j234] [j229] [j227] [j224] [j222] [j220] [j218] [j217] [i15] [j216] [j211] [j210] [j209] [j207] [j206] [j205] [j204] [c18] [j202] [j200] [j199] [j197] [j195] [i14] [j193] [j188] [j187] [j186] [j181] [j180] [j179] [j178] [j176] [j175] [j171] [i12] [j169] [j168] [j166] [j165] [j163] [j161] [j160] [j155] [j154] [j153] [j150] [j149] [j148] [j147] [j146] [j144] [j143] [j142] [i6] [i5] [j141] [j140] [j139] [j138] [j137] [j135] [j134] [j133] [i3] [i2] [j132] [j131] [i1] [j130] [j127] [j126] [c17] [c16] [j124] [j122] [j121] [j120] [j119] [j118] [j117] [j116] [j115] [j113] [c15] [j112] [j107] [j106] [c13] [j97]
[j190] [j184] [j170] [i11] [i10] [i9] [i8] [i7] [j136] [j128] [j127] [j123] [j104] [j102] [j99] [j98] [j97] [j93] [j90] [j84] [j83] [c11] [j80] [j79] [c10] [j75] [j74] [j73] [j72] [j71] [j70] [j66] [j63] [j59] [e2] [j51] [j48] [j47] [c8] [c7] [c6] [c5] [j44] [j43] [j42] [j36] [j28] [j27] [j26] [j23] [j20]
[j239] [j237] [j236] [j235] [j234] [j233] [j232] [j231] [j228] [j226] [j225] [j224] [j223] [j221] [j220] [j219] [j217] [j216] [j214] [j213] [j212] [j211] [j210] [j207] [j206] [j204] [j201] [j200] [j199] [j198] [j196] [j195] [j194] [j193] [j192] [j191] [j189] [j188] [j186] [j183] [j182] [j181] [j177] [j175] [j173] [j165] [j163] [j162] [j148] [j146] [j143]
Sophie Spirkl
aka: Sophie Theresa Spirkl
aka: Sophie Theresa Spirkl
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
