DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Klaus Wagner
Klaus Wagner
Nowhere-Zero Flows in Regular Matroids and Hadwiger's Conjecture
Sphere-Cut Decompositions and Dominating Sets in Planar Graphs
Derandomizing Isolation Lemma for K3,3-Free and K5-Free Bipartite Graphs
Planar Graphs and Wagner's And
Layered Separators in Minor-Closed Graph Classes with Applications
Graph Minors and Minimum Degree
Planar Graph - Wikipedia, the Free Encyclopedia Page 1 of 7
A Characterization of Almost All Minimal Not Nearly Planar Graphs Kwang Ju Choi Louisiana State University and Agricultural and Mechanical College,
[email protected]
[Math.CO] 9 Jan 2006 U Oksoha[]Adtoao 1,16]
Independent Sets in Graphs with an Excluded Clique Minor David R
Disproof of the List Hadwiger Conjecture
Reachability in K3,3-Free and K5-Free Graphs Is in Unambiguous Logspace ∗
Spring 2007 [Pdf]
Clique-Width for Hereditary Graph Classes 2
Graph Minors, Bidimensionality and Algorithms
Derandomizing Isolation Lemma for K3,3-Free and K5-Free Bipartite Graphs
On the Maximum Number of Cliques in a Graph 3
Graphs and Combinatorics (2007) 23:1–46 Digital Object Identifier (DOI) 10.1007/S00373-006-0684-X Graphs and Combinatorics © Springer-Verlag 2007
Top View
A Hadwiger Conjecture for Hyperplane Arrangements
Derandomizing Isolation Lemma for $ K {3, 3} $-Free and $ K 5 $-Free
FORBIDDEN GRAPH MINORS Contents 1. Introduction 2 2
Crossing Numbers Carl Joshua Quines August 22, 2016
Disproof of the List Hadwiger Conjecture
Graph Isomorphism for K3,3-Free and K5-Free Graphs Is in Log-Space
GRAPH MINOR THEORY 1. Introduction Let Us Start with Recalling Kuratowski's Theorem
Thomassen's Choosability Argument Revisited
Reachability in K3,3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
And Containment Relations in Graphs✩
Complementary Triple Connected Clique