On the public citation graph

Disjoint homotopic paths and trees in a planar graph

https://doi.org/10.1007/bf02574704
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-95432-0_9openalex-snapshot
River Routing: Methodology and Analysis
inferredcites →https://doi.org/10.1016/0095-8956(86)90031-6openalex-snapshot
Graph minors. VI. Disjoint paths across a disc
inferredcites →https://doi.org/10.1016/0095-8956(88)90070-6openalex-snapshot
Graph minors. VII. Disjoint paths on a surface
inferredcites →https://doi.org/10.1016/0095-8956(91)90009-9openalex-snapshot
Disjoint circuits of prescribed homotopies in a graph on a compact surface
inferredcites →https://doi.org/10.1090/dimacs/001openalex-snapshot
Polyhedral Combinatorics
inferredcites →https://doi.org/10.1090/dimacs/001/13openalex-snapshot
Vertex-disjoint simple paths of given homotopy in a planar graph
inferredcites →https://doi.org/10.1109/sfcs.1984.715902openalex-snapshot
River Routing Every Which Way, But Loose
inferredcites →https://doi.org/10.1145/22145.22153openalex-snapshot
Algorithms for routing and testing routability of planar VLSI layouts
inferredcites →https://doi.org/10.2307/2313470openalex-snapshot
Algebraic Topology: An Introduction.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.1023openalex-snapshot
Obstruction sets for outer‐cylindrical graphs
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_14openalex-snapshot
Drawing with Fat Edges
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_23openalex-snapshot
Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-9112-7_16openalex-snapshot
Paths in Graphs and Curves on Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_12openalex-snapshot
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_8openalex-snapshot
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
inferred← citeshttps://doi.org/10.1007/bf01190507openalex-snapshot
The complexity of induced minors and related problems
inferred← citeshttps://doi.org/10.1007/s00453-014-9923-3openalex-snapshot
Pure Nash Equilibria in Graphical Games and Treewidth
inferred← citeshttps://doi.org/10.1007/s10107-010-0372-8openalex-snapshot
Recognizing binet matrices
inferred← citeshttps://doi.org/10.1007/s10107-024-02174-0openalex-snapshot
Neighborhood persistency of the linear optimization relaxation of integer linear optimization
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90040-5openalex-snapshot
On obstructions to small face covers in planar graphs
inferred← citeshttps://doi.org/10.1109/focs.2011.52openalex-snapshot
The Graph Minor Algorithm with Parity Conditions
inferred← citeshttps://doi.org/10.1137/0219063openalex-snapshot
Linear-Time Test for Small Face Covers in any Fixed Surface
inferred← citeshttps://doi.org/10.1137/s0097539792224061openalex-snapshot
Finding k Disjoint Paths in a Directed Planar Graph
inferred← citeshttps://doi.org/10.1137/s0097539796312733openalex-snapshot
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
inferred← citeshttps://doi.org/10.1142/s0129054106004315openalex-snapshot
DRAWING WITH FAT EDGES
inferred← citeshttps://doi.org/10.1145/237814.238007openalex-snapshot
Node-disjoint paths on the mesh and a new trade-off in VLSI layout
inferred← citeshttps://doi.org/10.1145/276698.276867openalex-snapshot
Decision algorithms for unsplittable flow and the half-disjoint paths problem
inferred← citeshttps://doi.org/10.1145/3717823.3718109openalex-snapshot
Disjoint Paths Problem with Group-Expressable Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3566openalex-snapshot
Free partially commutative groups, cohomology, and paths and circuits in directed graphs on surfaces
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3938openalex-snapshot
Recognition of generalized network matrices
inferred← citeshttps://doi.org/10.5555/1109557.1109650openalex-snapshot
Subgraph characterization of red/blue-split graph and konig egerváry graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.