The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul D. Seymour: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiway Cuts (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    STOC, 1992, pp:241-251 [Conf]
  2. Neil Robertson, Paul D. Seymour
    Graph Minors. II. Algorithmic Aspects of Tree-Width. [Citation Graph (2, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:3, pp:309-322 [Journal]
  3. Maria Chudnovsky, Paul D. Seymour
    The structure of claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Surveys in Combinatorics, 2005, pp:153-171 [Conf]
  4. Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour
    Finding dsjoint trees in planar graphs in linear time. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:295-302 [Conf]
  5. Neil Robertson, Paul D. Seymour
    Excluding a graph with one crossing. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:669-676 [Conf]
  6. Neil Robertson, Paul D. Seymour, Robin Thomas
    A survey of linkless embeddings. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:125-136 [Conf]
  7. Neil Robertson, Paul D. Seymour, Robin Thomas
    Structural descriptions of lower ideals of trees. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:525-538 [Conf]
  8. Sang-il Oum, Paul D. Seymour
    Certifying large branch-width. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:810-813 [Conf]
  9. Noga Alon, Paul D. Seymour, Robin Thomas
    A Separator Theorem for Graphs with an Excluded Minor and its Applications [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:293-299 [Conf]
  10. Fan R. K. Chung, D. J. Hajela, Paul D. Seymour
    Self-Organizing Sequential Search and Hilbert's Inequalities [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:217-223 [Conf]
  11. William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas
    Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:402-405 [Conf]
  12. Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
    Efficiently Four-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:571-575 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    WIFT, 1998, pp:84-85 [Conf]
  14. Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
    The smallets n-uniform hypergraph with positive discrepancy. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:2, pp:151-160 [Journal]
  15. Guoli Ding, Paul D. Seymour, Peter Winkler
    Bounding the Vertex Cover Number of a Hypergraph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:1, pp:23-34 [Journal]
  16. Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic
    Recognizing Berge Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:2, pp:143-186 [Journal]
  17. Zoltán Füredi, Jeff Kahn, Paul D. Seymour
    On the fractional matching polytope of a hypergraph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:2, pp:167-180 [Journal]
  18. D. J. Hajela, Paul D. Seymour
    Counting points in hypercubes and convolution measure algebras. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:3, pp:205-214 [Journal]
  19. Jeff Kahn, Paul D. Seymour
    A fractional version of the Erdös-Faber-Lovász conjecture. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:2, pp:155-160 [Journal]
  20. Paul D. Seymour
    Reconizing graphic matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:1, pp:75-78 [Journal]
  21. Paul D. Seymour
    On minors of non-binary matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:387-394 [Journal]
  22. Paul D. Seymour
    Packing nearly-disjoint sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:1, pp:91-97 [Journal]
  23. Paul D. Seymour
    Colouring series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:4, pp:379-392 [Journal]
  24. Paul D. Seymour
    Directed circuits on a torus. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:3, pp:261-273 [Journal]
  25. Paul D. Seymour
    Packing Directed Circuits Fractionally. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:2, pp:281-288 [Journal]
  26. Paul D. Seymour
    Packing Circuits in Eulerian Digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:2, pp:223-231 [Journal]
  27. Paul D. Seymour, Robin Thomas
    Call Routing and the Ratcatcher. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:217-241 [Journal]
  28. Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas
    Packing Directed Circuits. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:4, pp:535-554 [Journal]
  29. Neil Robertson, Paul D. Seymour, Robin Thomas
    Hadwiger's conjecture for K 6-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:3, pp:279-361 [Journal]
  30. Alexander Schrijver, Paul D. Seymour
    Solution of two fractional packing problems of Lovász. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:973-978 [Journal]
  31. Paul D. Seymour
    Disjoint paths in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:979-991 [Journal]
  32. Bruce A. Reed, Paul D. Seymour
    Hadwiger's conjecture for line graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:873-876 [Journal]
  33. William Cook, Paul D. Seymour
    Tour Merging via Branch-Decomposition. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2003, v:15, n:3, pp:233-248 [Journal]
  34. Daniel Bienstock, Paul D. Seymour
    Monotonicity in Graph Searching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:239-245 [Journal]
  35. Fan R. K. Chung, D. J. Hajela, Paul D. Seymour
    Self-organizing Sequential Search and Hilbert's Inequalities. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:2, pp:148-157 [Journal]
  36. Takao Asano, Takao Nishizeki, Paul D. Seymour
    A note on nongraphic matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:290-293 [Journal]
  37. Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas
    Quickly excluding a forest. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:274-283 [Journal]
  38. Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour
    On induced subgraphs of the cube. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:1, pp:180-187 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:25-41 [Journal]
  40. Matt DeVos, Paul D. Seymour
    Extending partial 3-colourings in a planar graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:219-225 [Journal]
  41. Guoli Ding, Alexander Schrijver, Paul D. Seymour
    Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:58, n:1, pp:40-45 [Journal]
  42. Zhicheng Gao, R. Bruce Richter, Paul D. Seymour
    Irreducible Triangulations of Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:206-217 [Journal]
  43. Joan P. Hutchinson, R. Bruce Richter, Paul D. Seymour
    Colouring Eulerian Triangulations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:225-239 [Journal]
  44. Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
    Directed Tree-Width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:138-154 [Journal]
  45. Bojan Mohar, Paul D. Seymour
    Coloring Locally Bipartite Graphs on Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:301-310 [Journal]
  46. Bruce A. Reed, Paul D. Seymour
    Fractional Colouring and Hadwiger's Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:74, n:2, pp:147-152 [Journal]
  47. Neil Robertson, Paul D. Seymour
    Graph Minors. XVI. Excluding a non-planar graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:89, n:1, pp:43-76 [Journal]
  48. Neil Robertson, Paul D. Seymour
    Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:89, n:1, pp:77-108 [Journal]
  49. Neil Robertson, Paul D. Seymour
    Graph Minors. XX. Wagner's conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:325-357 [Journal]
  50. Neil Robertson, Paul D. Seymour
    Graph Minors. XIX. Well-quasi-ordering on a surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:325-385 [Journal]
  51. Neil Robertson, Paul D. Seymour
    Graph minors. I. Excluding a forest. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:1, pp:39-61 [Journal]
  52. Neil Robertson, Paul D. Seymour
    Graph minors. III. Planar tree-width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:1, pp:49-64 [Journal]
  53. Neil Robertson, Paul D. Seymour
    Graph minors. V. Excluding a planar graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:92-114 [Journal]
  54. Neil Robertson, Paul D. Seymour
    Graph minors. VI. Disjoint paths across a disc. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:115-138 [Journal]
  55. Neil Robertson, Paul D. Seymour
    Graph minors. VII. Disjoint paths on a surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:212-254 [Journal]
  56. Neil Robertson, Paul D. Seymour
    Graph minors. IX. Disjoint crossed paths. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:1, pp:40-77 [Journal]
  57. Neil Robertson, Paul D. Seymour
    Graph minors. IV. Tree-width and well-quasi-ordering. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:227-254 [Journal]
  58. Neil Robertson, Paul D. Seymour
    Graph minors. VIII. A kuratowski theorem for general surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:255-288 [Journal]
  59. Neil Robertson, Paul D. Seymour
    Graph minors. X. Obstructions to tree-decomposition. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:153-190 [Journal]
  60. Neil Robertson, Paul D. Seymour
    Graph Minors. XI. Circuits on a Surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:60, n:1, pp:72-106 [Journal]
  61. Neil Robertson, Paul D. Seymour
    Graph Miners .XIV. Extending an Embedding. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:65, n:1, pp:23-50 [Journal]
  62. Neil Robertson, Paul D. Seymour
    Graph Minors .XII. Distance on a Surface. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:240-272 [Journal]
  63. Neil Robertson, Paul D. Seymour
    Graph Minors .XIII. The Disjoint Paths Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:65-110 [Journal]
  64. Neil Robertson, Paul D. Seymour
    Graph Minors: XV. Giant Steps. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:1, pp:112-148 [Journal]
  65. Neil Robertson, Paul D. Seymour
    Graph Minors: XVII. Taming a Vortex. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:162-210 [Journal]
  66. Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
    The Four-Colour Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:2-44 [Journal]
  67. Neil Robertson, Paul D. Seymour, Robin Thomas
    Quickly Excluding a Planar Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:323-348 [Journal]
  68. Neil Robertson, Paul D. Seymour, Robin Thomas
    Kuratowski Chains. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:127-154 [Journal]
  69. Neil Robertson, Paul D. Seymour, Robin Thomas
    Petersen Family Minors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:155-184 [Journal]
  70. Neil Robertson, Paul D. Seymour, Robin Thomas
    Sachs' Linkless Embedding Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:185-227 [Journal]
  71. Neil Robertson, Paul D. Seymour, Robin Thomas
    Tutte's Edge-Colouring Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:166-183 [Journal]
  72. Alexander Schrijver, Paul D. Seymour
    A simpler proof and a generalization of the zero-trees theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:2, pp:301-305 [Journal]
  73. Alexander Schrijver, Paul D. Seymour
    Packing Odd Paths. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:2, pp:280-288 [Journal]
  74. Paul D. Seymour
    Even circuits in planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:327-338 [Journal]
  75. Paul D. Seymour
    On the connectivity function of a matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:25-30 [Journal]
  76. Paul D. Seymour
    On secret-sharing matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:1, pp:69-73 [Journal]
  77. Paul D. Seymour
    A Note on Hyperplane Generation. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:88-91 [Journal]
  78. Paul D. Seymour
    Two Chromatic Polynomial Conjectures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:1, pp:184-196 [Journal]
  79. Paul D. Seymour
    A Note on List Arboricity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:150-151 [Journal]
  80. Paul D. Seymour, Carsten Thomassen
    Characterization of even directed graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:36-45 [Journal]
  81. Paul D. Seymour, Robin Thomas
    Graph Searching and a Min-Max Theorem for Tree-Width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:58, n:1, pp:22-33 [Journal]
  82. Paul D. Seymour, Klaus Truemper
    A Petersen on a Pentagon. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:63-79 [Journal]
  83. Sang-il Oum, Paul D. Seymour
    Approximating clique-width and branch-width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:514-528 [Journal]
  84. Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan
    Proper minor-closed families are small. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:5, pp:754-757 [Journal]
  85. Maria Chudnovsky, Paul D. Seymour
    The roots of the independence polynomial of a clawfree graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:350-357 [Journal]
  86. Sang-il Oum, Paul D. Seymour
    Testing branch-width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:3, pp:385-393 [Journal]
  87. Paul D. Seymour
    Nowhere-zero 6-flows. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:2, pp:130-135 [Journal]
  88. Paul D. Seymour
    Decomposition of regular matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:3, pp:305-359 [Journal]
  89. Paul D. Seymour
    Packing and covering with matroid circuits. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:237-242 [Journal]
  90. Paul D. Seymour
    Matroid representation over GF(3). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:2, pp:159-173 [Journal]
  91. Paul D. Seymour
    A short proof of the two-commodity flow theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:3, pp:370-371 [Journal]
  92. Paul D. Seymour
    The matroids with the max-flow min-cut property. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:2-3, pp:189-222 [Journal]
  93. Paul D. Seymour
    A note on the production of matroid minors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:3, pp:289-295 [Journal]
  94. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiterminal Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:864-894 [Journal]
  95. Noga Alon, Paul D. Seymour, Robin Thomas
    Planar Separators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:2, pp:184-193 [Journal]
  96. Guoli Ding, Alexander Schrijver, Paul D. Seymour
    Disjoint Paths in a Planar Graph - A General Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:112-116 [Journal]
  97. Alexander Schrijver, Paul D. Seymour, Peter Winkler
    The Ring Loading Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:1-14 [Journal]
  98. Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour
    Detecting even holes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:85-111 [Journal]
  99. Maria Chudnovsky, Paul D. Seymour
    Testing for a theta. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:595-598 [Conf]
  100. Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour
    Packing Non-Zero A-Paths In Group-Labelled Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:5, pp:521-532 [Journal]
  101. Fan R. K. Chung, Paul D. Seymour
    Graphs with small bandwidth and cutwidth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:113-119 [Journal]
  102. Neil Robertson, Paul D. Seymour, Robin Thomas
    Excluding infinite minors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:303-319 [Journal]
  103. Paul D. Seymour, Robin Thomas
    An end-faithful spanning tree counterexample. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:321-330 [Journal]
  104. Maurits de Graaf, Alexander Schrijver, Paul D. Seymour
    Directed triangles in directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:279-282 [Journal]
  105. R. Bruce Richter, Paul D. Seymour, Jozef Sirán
    Circular embeddings of planar graphs in nonspherical surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:273-280 [Journal]
  106. Maria Chudnovsky, Paul D. Seymour
    Claw-free graphs. I. Orientable prismatic graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:867-903 [Journal]

  107. Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. [Citation Graph (, )][DBLP]


  108. Cycles in dense digraphs. [Citation Graph (, )][DBLP]


  109. Counting paths in digraphs. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002