Graph minors. XX: Wagner's conjecture
From MaRDI portal
Publication:705888
DOI10.1016/j.jctb.2004.08.001zbMath1061.05088WikidataQ55934687 ScholiaQ55934687MaRDI QIDQ705888
Publication date: 16 February 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.08.001
05C65: Hypergraphs
05C10: Planar graphs; geometric and topological aspects of graph theory
57M15: Relations of low-dimensional topology with graph theory
05C83: Graph minors
Related Items
On possible counterexamples to Negami's planar cover conjecture, Mineurs d'arbres avec racines, Recognizing small subgraphs, The communication complexity of enumeration, elimination, and selection, Obstructions for embedding cubic graphs on the spindle surface, A simple linear-time algorithm for finding path-decompositions of small width, Fixed-parameter tractability and completeness II: On completeness for W[1], Mixed searching and proper-path-width, Advice classes of parametrized tractability, Excluding infinite minors, On obstructions to small face covers in planar graphs, Upper bounds on the size of obstructions and intertwines, A partial k-arboretum of graphs with bounded treewidth, Transformations in closed 2-cell embeddings on surfaces preserving specified properties, Diagonal flips in triangulations on closed surfaces with minimum degree at least 4, Complexity of protein folding, Improved self-reduction algorithms for graphs with bounded treewidth, Obstruction set isolation for the gate matrix layout problem, Diagonal flips in triangulations of surfaces, A minor-monotone graph parameter based on oriented matroids, The obstructions of a minor-closed set of graphs defined by a context-free grammar, On immersions of uncountable graphs, The forbidden minor characterization of line-search antimatroids of rooted digraphs, Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\), Graph minors. XIX: Well-quasi-ordering on a surface., On computing graph minor obstruction sets, On the immersion relation and an embedding problem for infinite graphs, On the structure of \(k\)-connected graphs without \(K_{k}\)-minor, Excluding any graph as a minor allows a low tree-width 2-coloring, Graphs with magnetic Schrödinger operators of low corank, A linear time algorithm for monadic querying of indefinite data over linearly ordered domains, Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues], On the invariance of Colin de Verdière's graph parameter under clique sums, The complexity of generalized graph colorings, One-third-integrality in the max-cut problem, Unnamed Item, Obstruction sets for outer-cylindrical graphs, Polynomial-time self-reducibility: theoretical motivations and practical results∗
Cites Work
