...
首页> 外文期刊>Discrete Applied Mathematics >A note on planar graphs with large width parameters and small grid-minors
【24h】

A note on planar graphs with large width parameters and small grid-minors

机译:关于具有较大宽度参数和较小网格网格的平面图的注释

获取原文
获取原文并翻译 | 示例
           

摘要

Given a graph G with tree-width ω(G), branch-width β(G), and side size of the largest square grid-minor θ(G), it is known that θ(G)≤β(G)≤ω(G)+1≤32β(G). In this paper, we introduce another approach to bound the side size of the largest square grid-minor specifically for planar graphs. The approach is based on measuring the distances between the faces in an embedding of a planar graph. We analyze the tightness of all derived bounds. In particular, we present a class of planar graphs where θ(G)=β(G)<ω(G)=?32θ(G)?-1.
机译:给定一个具有树宽ω(G),分支宽度β(G)和最大正方形网格次方θ(G)的边尺寸的图G,已知θ(G)≤β(G)≤ ω(G)+1≤32β(G)。在本文中,我们引入了另一种方法来绑定最大的方形栅格小边的大小,专门用于平面图。该方法基于在平面图的嵌入中测量面之间的距离。我们分析所有派生边界的紧密度。特别地,我们提出了一类平面图,其中θ(G)=β(G)<ω(G)=?32θ(G)?-1。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号