Intersection graphs of L-shapes and segments in the plane
Intersection graphs of L-shapes and segments in the plane
复制标题
L 形和平面内线段的交图
DOI:
10.1016/j.dam.2016.01.028
复制
发表时间:
2016
影响因子:
1.1
通讯作者:
Felsner S
中科院分区:
文献类型:
--
作者:
Felsner S
An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations:,, and. A k-bend path is a simple path in the plane, whose direction changes k times from horizontal to vertical. If a graph admits an intersection representation in which every vertex is represented by an, an or, a k-bend path, or a segment, then this graph is called an {}-graph,{,}-graph, B k-VPG-graph or SEG-graph, respectively. Motivated by a theorem of Middendorf and Pfeiffer (1992), stating that every {,}-graph is a SEG-graph, we investigate several known subclasses of SEG-graphs and show that they are {}-graphs, or B k-VPG-graphs for some small constant k. We show that all planar 3-trees, all line graphs of planar graphs, and all full subdivisions of planar graphs are {}-graphs. Furthermore we show that complements of planar graphs are B 17-VPG-graphs and complements of full subdivisions are B 2-VPG-graphs. Here a full subdivision is a graph in which each edge is subdivided at least once.
登录
查看更多内容
DOI:
10.1137/1.9781611973105.120
发表时间:
2012
期刊:
ArXiv
影响因子:
--
作者:
S. Kobourov;T. Ueckerdt;Kevin Verbeek
通讯作者:
Kevin Verbeek
影响因子:
1.1
作者:
H. D. Fraysseix;P. D. Mendez
通讯作者:
P. D. Mendez
DOI:
10.1016/j.disc.2012.01.024
发表时间:
2010
期刊:
Discret. Math.
影响因子:
--
作者:
Mathew C. Francis;Jan Kratochvíl;Tomás Vyskocil
通讯作者:
Tomás Vyskocil
DOI:
10.1016/s0012-365x(97)81834-1
发表时间:
1998
期刊:
Discret. Math.
影响因子:
--
作者:
Jan Kratochvíl;A. Kuběna
通讯作者:
A. Kuběna
影响因子:
0.8
作者:
Jérémie Chalopin;D. Gonçalves;P. Ochem
通讯作者:
P. Ochem