Disjoint homotopic paths and trees in a planar graph
From MaRDI portal
Publication:1179127
DOI10.1007/BF02574704zbMath0755.05033MaRDI QIDQ1179127
Publication date: 26 June 1992
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131173
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The complexity of induced minors and related problems ⋮ Recognizing binet matrices ⋮ Neighborhood persistency of the linear optimization relaxation of integer linear optimization ⋮ Obstruction sets for outer-cylindrical graphs ⋮ On obstructions to small face covers in planar graphs ⋮ DRAWING WITH FAT EDGES ⋮ Pure Nash equilibria in graphical games and treewidth
Cites Work