Add to ORKGGiven any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices so that (a) no two of them have an interior point in common, (b) two segments have a point in common if and only if the corresponding vertices are adjacent in G
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
Abstract. A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
AbstractAnswering a problem of H. de Fraysseix and P. Rosenstiehl we prove that every planar graph c...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in ...
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in ...
A planar graph visibility representation maps each vertex to a horizontal segment at a vertical posi...
A planar graph visibility representation maps each vertex to a horizontal segment at a vertical posi...
AbstractWe prove that each simple planar graph G whose all faces are quadrilaterals can be decompose...
AbstractA plane integral drawing of a planar graph G is a realization of G in the plane such that th...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
We prove that every triangle-free planar graph is the intersection graph of a set of segments in the...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
Abstract. A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
AbstractAnswering a problem of H. de Fraysseix and P. Rosenstiehl we prove that every planar graph c...
AbstractA graph is a segment graph if its vertices can be mapped to line segments in the plane such ...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in ...
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in ...
A planar graph visibility representation maps each vertex to a horizontal segment at a vertical posi...
A planar graph visibility representation maps each vertex to a horizontal segment at a vertical posi...
AbstractWe prove that each simple planar graph G whose all faces are quadrilaterals can be decompose...
AbstractA plane integral drawing of a planar graph G is a realization of G in the plane such that th...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
We prove that every triangle-free planar graph is the intersection graph of a set of segments in the...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
Planar graphs are known to have geometric representations of various types, e.g. as contacts of disk...
Abstract. A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex...