Given two line segments in the plane, we say they are in T-position if the line containing one of the segments intersects the other segment. A segment T-graph has its vertices in one-to-one correspondence with pairwise disjoint planar line segments so that two vertices are adjacent iff they are in T-position. We give two proofs that not all graphs are segment T-graphs
AbstractG. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 p...
AbstractLet G be a planar graph with n vertices, v be a specified vertex of G, and P be a set of n p...
For a set S of n lines labeled from 1 to n, we say that S supports an n-vertex planar graph G if for...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
International audienceGiven a set S of segments in the plane, the intersection graph of S is the gra...
International audienceGiven a set S of segments in the plane, the intersection graph of S is the gra...
We prove that every triangle-free planar graph is the intersection graph of a set of segments in th...
Motivated by an open problem from graph drawing, we study several partitioning problems for line and...
Abstract. Motivated by an open problem from graph drawing, we study several partitioning problems fo...
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in ...
AbstractH. de Fraysseix and P. Ossona de Mendez asked whether every planar linear hypergraph H admit...
AbstractG. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 p...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
AbstractG. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 p...
AbstractLet G be a planar graph with n vertices, v be a specified vertex of G, and P be a set of n p...
For a set S of n lines labeled from 1 to n, we say that S supports an n-vertex planar graph G if for...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
International audienceGiven a set S of segments in the plane, the intersection graph of S is the gra...
International audienceGiven a set S of segments in the plane, the intersection graph of S is the gra...
We prove that every triangle-free planar graph is the intersection graph of a set of segments in th...
Motivated by an open problem from graph drawing, we study several partitioning problems for line and...
Abstract. Motivated by an open problem from graph drawing, we study several partitioning problems fo...
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in ...
AbstractH. de Fraysseix and P. Ossona de Mendez asked whether every planar linear hypergraph H admit...
AbstractG. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 p...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
AbstractG. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 p...
AbstractLet G be a planar graph with n vertices, v be a specified vertex of G, and P be a set of n p...
For a set S of n lines labeled from 1 to n, we say that S supports an n-vertex planar graph G if for...