Graph minors. VII: Disjoint paths on a surface
From MaRDI portal
Publication:1111568
DOI10.1016/0095-8956(88)90070-6zbMath0658.05044MaRDI QIDQ1111568
Publication date: 1988
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(88)90070-6
compact surface; forest; graphs on surfaces; vertex-disjoint paths; disjoint connecting paths; homoplasty
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C99: Graph theory
Related Items
Coloring-flow duality of embedded graphs, Regular maps on surfaces with large planar width, Representations of graphs and networks (coding, layouts and embeddings), Disjoint homotopic paths and trees in a planar graph, Circuits in graphs embedded on the torus, On obstructions to small face covers in planar graphs, On the uniqueness of kernels, A partial k-arboretum of graphs with bounded treewidth, Rooted routing in the plane, A simple construction of high representativity triangulations, Non-revisiting paths on surfaces with low genus, The disjoint shortest paths problem, Subgraphs of graphs on surfaces with high representativity, Graph minors. XIX: Well-quasi-ordering on a surface., On essential and inessential polygons in embedded graphs, Colouring Eulerian triangulations, Coloring locally bipartite graphs on surfaces., Long cycles in graphs on a fixed surface, Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces, A theorem on paths in locally planar triangulations, Planar graphs on the projective plane, Unnamed Item, Unnamed Item
