首页> 美国政府科技报告 >Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs
【24h】

Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs

机译:直线平面图中的边不相交同伦路径

获取原文

摘要

Let G be a planar graph, embedded without crossings in the euclidean plane Rsq, and let I1, ..., Ip be some of its faces (including the unbounded face), considered as open sets. Suppose there exist (straight) line segments L1, ..., Lt in Rsq so that GuI1u...uIp = L1u...uLtuI1u...uIp and so that each Li has its end points in I1u...uIp. Let C1, ..., C1, be curves in Rsq/(I1u...uIp) with end points in vertices of G. Conditions under which there exist pairwise edge-disjoint paths P1, ..., Pk in G so that P1 is homotopic to Ci in Rsq/(I1u...uIp), for i = 1, ..., k are described. This extends results of Kaufmann and Mehlhorn (1986) for graphs derived from the rectangular grid.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号