|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan |
The Erdős-Pósa property for clique minors in highly connected graphs.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan |
K_6 minors in large 6-connected graphs  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan |
K_6 minors in 6-connected graphs of bounded tree-width  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Paul Wollan |
Packing cycles with modularity constraints.  |
Combinatorica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Wollan |
New Proofs in Graph Minors.  |
MFCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed, Paul Wollan |
The Graph Minor Algorithm with Parity Conditions.  |
FOCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Paul Wollan |
A simpler algorithm and shorter proof for the graph minor decomposition.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Wollan |
Packing non-zero A-paths in an undirected model of group labeled graphs.  |
J. Comb. Theory, Ser. B  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Paul Wollan |
Bridges in Highly Connected Graphs.  |
SIAM J. Discrete Math.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Paul Wollan |
A shorter proof of the graph minor algorithm: the unique linkage theorem.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan |
A weaker version of Lovász' path removal conjecture.  |
J. Comb. Theory, Ser. B  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Paul Wollan |
The extremal function for 3-linked graphs.  |
J. Comb. Theory, Ser. B  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Wollan |
Extremal functions for rooted minors.  |
Journal of Graph Theory  |
2008 |
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 | Ken-ichi Kawarabayashi, Paul Wollan |
Non-zero disjoint cycles in highly connected group labelled graphs.  |
J. Comb. Theory, Ser. B  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Wollan |
Extremal Functions for Shortening Sets of Paths.  |
Combinatorics, Probability & Computing  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Paul Wollan |
Non-zero disjoint cycles in highly connected group labeled graphs.  |
Electronic Notes in Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan |
Generation of simple quadrangulations of the sphere.  |
Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Paul Wollan |
An improved linear edge bound for graph linkages.  |
Eur. J. Comb.  |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|