Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ SIAM Journal on Disc...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
SIAM Journal on Discrete Mathematics
Article . 1991 . Peer-reviewed
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs

Authors: A. Schrijver;

Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs

Abstract

Let G be a planar graph, embedded without crossings in the euclidean plane $\mathbb{R}^2 $, and let $I_1 , \cdots ,I_p $ be some of its faces (including the unbounded face), considered as open sets. Suppose there exist (straight) line segments $L_1 , \cdots ,L_t $ in $\mathbb{R}^2 $ so that $G \cup I_1 \cup \cdots \cup I_p = L_1 \cup \cdots \cup L_t \cup I_1 \cup \cdots \cup I_p $ and so that each $L_i $ has its end points in $I_1 \cup \cdots \cup I_p $. Let $C_1 , \cdots ,C_k $ be curves in $\mathbb{R}^2 \backslash ( I_1 \cup \cdots \cup I_p )$ with end points in vertices of G. Conditions are described under which there exist pairwise edge-disjoint paths $P_1 , \cdots ,P_k $ in G so that $P_i $ is homotopic to $C_i $ in $\mathbb{R}^2 \backslash ( I_1 \cup \cdots \cup I_p ),$ for $i = 1, \cdots ,k$. This extends results of Kaufmann and Mehlhorn for graphs derived from the rectangular grid.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    5
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
5
Average
Top 10%
Average
bronze