Graph minors. VIII: A Kuratowski theorem for general surfaces

From MaRDI portal
Revision as of 10:22, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2639870

DOI10.1016/0095-8956(90)90121-FzbMath0719.05033OpenAlexW2039565992MaRDI QIDQ2639870

Neil Robertson, P. D. Seymour

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90121-f




Related Items (53)

The Early Evolution of the Random Graph Process in Planar Graphs and Related ClassesAbsolute Lipschitz extendabilityThe projective-planar signed graphsEmbedding grids in surfacesAn infinite antichain of planar tanglegramsGrids and their minorsFixed-Parameter Tractability of Treewidth and PathwidthTopological Graph Theory: A Personal AccountObstructions for two-vertex alternating embeddings of graphs in surfacesGraph minors. IV: Tree-width and well-quasi-orderingA simpler proof of the excluded minor theorem for higher surfacesGraph minors. VII: Disjoint paths on a surfaceEmbeddings of one kind of graphsObstructions for embedding cubic graphs on the spindle surfaceProperties of Large 2-Crossing-Critical GraphsApproximation Algorithms for Euler Genus and Related ProblemsProjective plan and Möbius band obstructionsIdentifying the minor set cover of dense connected bipartite graphs via random matching edge setsObstructions for the Disk and the Cylinder Embedding Extension ProblemsEmbedding graphs in the torus in linear timeExcluded minors for the Klein bottle. I: Low connectivity caseA large set of torus obstructions and how they were discoveredThe theory of guaranteed search on graphsGraph minors. XIX: Well-quasi-ordering on a surface.The kernelization complexity of connected domination in graphs with (no) small cyclesMetric uniformization and spectral bounds for graphsSurface embedding of \((n,k)\)-extendable graphsUpper Bounds on the Graph Minor TheoremCharacterization of groups with planar, toroidal or projective planar (proper) reduced power graphsGraph minors. X: Obstructions to tree-decompositionThe 2 and 3 representative projective planar embeddingsKuratowski-type theorems do not extend to pseudosurfacesSolution to König's Graph Embedding ProblemSurvey article: consequences of some outerplanarity extensionsOn obstructions to small face covers in planar graphsExtending Lipschitz functions via random metric partitionsOuter-embeddability in certain pseudosurfaces arising from three spheresSingle source shortest paths in \(H\)-minor free graphsTwo applications of analytic functorsGraph minor theoryStronger ILPs for the Graph Genus Problem.New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfacesThe obstructions for toroidal graphs with no \(K_{3,3}\)'sA partial k-arboretum of graphs with bounded treewidthA Kuratowski theorem for nonorientable surfacesStructure and recognition of graphs with no 6-wheel subdivisionOpen problems on graphs arising from geometric topologyParameterized computation and complexity: a new approach dealing with NP-hardnessLog-Concavity of Combinations of Sequences and Applications to Genus DistributionsMatroids Determine the Embeddability of Graphs in SurfacesInfinite graph embeddings on tubular surfacesA Kuratowski Theorem for some PseudosurfacesForbidden minors and subdivisions for toroidal graphs with no K3,3's




Cites Work




This page was built for publication: Graph minors. VIII: A Kuratowski theorem for general surfaces