|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 133 publication records. Showing 133 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Maria Chudnovsky, Paul D. Seymour |
Three-colourable perfect graphs without even pairs.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour |
Tournament immersion and cutwidth. |
J. Comb. Theory, Ser. B |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors. XXII. Irrelevant vertices in linkage problems. |
J. Comb. Theory, Ser. B |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour |
The edge-density for K2, t minors. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
A well-quasi-order for tournaments. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour |
A local strengthening of Reed's ω, Δ, χ conjecture for quasi-line graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas |
K4-free graphs with no odd holes. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Claw-free graphs VI. Colouring. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph minors XXIII. Nash-Williams' immersion conjecture. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Blair Sullivan |
Counting paths in digraphs. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
The three-in-a-tree problem. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Even pairs in Berge graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph minors. XXI. Graphs with unique linkages. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta |
On the odd-minor variant of Hadwiger's conjecture. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Claw-free graphs. V. Global structure. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Claw-free graphs. IV. Decomposition theorem. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Claw-free graphs. III. Circular interval graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Solution of three problems of Cornuéjols. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Claw-free graphs. II. Non-orientable prismatic graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour, Blair Sullivan |
Cycles in dense digraphs. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C20, 05C35, 05C38 |
| 1 | Sang-il Oum, Paul D. Seymour |
Testing branch-width. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Claw-free graphs. I. Orientable prismatic graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
The roots of the independence polynomial of a clawfree graph. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
Testing for a theta. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sang-il Oum, Paul D. Seymour |
Approximating clique-width and branch-width. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan |
Proper minor-closed families are small. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour |
Disjoint paths in graphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Schrijver, Paul D. Seymour |
Solution of two fractional packing problems of Lovász. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour |
Packing Non-Zero A-Paths In Group-Labelled Graphs. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C22 |
| 1 | Sang-il Oum, Paul D. Seymour |
Certifying large branch-width. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic |
Recognizing Berge Graphs. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C17 |
| 1 | Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour |
Detecting even holes. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Paul D. Seymour |
The structure of claw-free graphs. |
Surveys in Combinatorics |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors. XIX. Well-quasi-ordering on a surface. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors. XX. Wagner's conjecture. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, Paul D. Seymour |
Hadwiger's conjecture for line graphs. |
Eur. J. Comb. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors. XVI. Excluding a non-planar graph. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt DeVos, Paul D. Seymour |
Extending partial 3-colourings in a planar graph. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas |
Progress on perfect graphs. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | William Cook, Paul D. Seymour |
Tour Merging via Branch-Decomposition. |
INFORMS Journal on Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan P. Hutchinson, R. Bruce Richter, Paul D. Seymour |
Colouring Eulerian Triangulations. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bojan Mohar, Paul D. Seymour |
Coloring Locally Bipartite Graphs on Surfaces. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas |
Directed Tree-Width. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamra Carpenter, Martin I. Eiger, David Shallcross, Paul D. Seymour |
Node Placement and Sizing for Copper Broadband Access Networks. |
Annals OR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors: XVII. Taming a Vortex. |
J. Comb. Theory, Ser. B |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, Paul D. Seymour |
Fractional Colouring and Hadwiger's Conjecture. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Klaus Truemper |
A Petersen on a Pentagon. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour |
A Note on List Arboricity. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Schrijver, Paul D. Seymour, Peter Winkler |
The Ring Loading Problem. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas |
The Four-Colour Theorem. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour |
Two Chromatic Polynomial Conjectures. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Tutte's Edge-Colouring Conjecture. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas |
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors: XV. Giant Steps. |
J. Comb. Theory, Ser. B |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, R. Bruce Richter, Paul D. Seymour |
Irreducible Triangulations of Surfaces. |
J. Comb. Theory, Ser. B |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour |
Packing Circuits in Eulerian Digraphs. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas |
Packing Directed Circuits. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas |
Efficiently Four-Coloring Planar Graphs. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors .XII. Distance on a Surface. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Miners .XIV. Extending an Embedding. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors .XIII. The Disjoint Paths Problem. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Sachs' Linkless Embedding Conjecture. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Petersen Family Minors. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Kuratowski Chains. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour |
Packing Directed Circuits Fractionally. |
Combinatorica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour |
A Note on Hyperplane Generation. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Quickly Excluding a Planar Graph. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph Minors. XI. Circuits on a Surface. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Schrijver, Paul D. Seymour |
Packing Odd Paths. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Bruce Richter, Paul D. Seymour, Jozef Sirán |
Circular embeddings of planar graphs in nonspherical surfaces. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Robin Thomas |
Call Routing and the Ratcatcher. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Guoli Ding, Paul D. Seymour, Peter Winkler |
Bounding the Vertex Cover Number of a Hypergraph. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Paul D. Seymour, Robin Thomas |
Planar Separators. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis |
The Complexity of Multiterminal Cuts. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Guoli Ding, Alexander Schrijver, Paul D. Seymour |
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Robin Thomas |
Graph Searching and a Min-Max Theorem for Tree-Width. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Hadwiger's conjecture for K 6-free graphs. |
Combinatorica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Jeff Kahn, Paul D. Seymour |
On the fractional matching polytope of a hypergraph. |
Combinatorica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour (eds.) |
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 |
Graph Structure Theory |
1993 |
DBLP BibTeX RDF |
|
| 1 | Paul D. Seymour |
On secret-sharing matroids. |
J. Comb. Theory, Ser. B |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurits de Graaf, Alexander Schrijver, Paul D. Seymour |
Directed triangles in directed graphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Kahn, Paul D. Seymour |
A fractional version of the Erdös-Faber-Lovász conjecture. |
Combinatorica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Guoli Ding, Alexander Schrijver, Paul D. Seymour |
Disjoint Paths in a Planar Graph - A General Theorem. |
SIAM J. Discrete Math. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis |
The Complexity of Multiway Cuts (Extended Abstract) |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Schrijver, Paul D. Seymour |
A simpler proof and a generalization of the zero-trees theorem. |
J. Comb. Theory, Ser. A |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Graph minors. X. Obstructions to tree-decomposition. |
J. Comb. Theory, Ser. B |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas |
Quickly excluding a forest. |
J. Comb. Theory, Ser. B |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Robin Thomas |
An end-faithful spanning tree counterexample. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Excluding infinite minors. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bienstock, Paul D. Seymour |
Monotonicity in Graph Searching. |
J. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour |
Directed circuits on a torus. |
Combinatorica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Structural descriptions of lower ideals of trees. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour |
Excluding a graph with one crossing. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
A survey of linkless embeddings. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
Displaying result #1 - #100 of 133 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")