Share This Author
Edge intersection graphs of L-shaped paths in grids
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
It is shown here that for every fixed k, Bk-VPG $\subsetneq$Bk+1- VPG is in no inclusion relation with the class of intersection graphs of straight line segments in the plane.
Grid Intersection Graphs and Order Dimension
A comprehensive study of classes of graphs between grid intersection graphs and bipartite permutation graphs and the containment relation on these classes is provided.
Extending partial representations of circle graphs
A polynomial-time algorithm for partial representation extension of circle graphs that describes the structure of all representation a circle graph based on split decomposition and shows whether one can draw the remaining chords into a partially pre-drawn representation.
Combinatorial Problems on H-graphs
The vertex leafage of chordal graphs
Max point-tolerance graphs
Planar Graphs as VPG-Graphs
This paper disproves the conjecture that all planar graphs are B3-VPG, and shows that the 4-connected planar graph constitute a subclass of the intersection graphs of Z-shapes, and demonstrates that a B2-V PG representation of a planargraph can be constructed in O(n) time.
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
These are the first classes of geometric graphs where extending partial representations is provably harder than recognition, as opposed to e.g. interval graphs, circle graphs, permutation graphs or even standard representations of plane graphs.
The Complexity of Drawing Graphs on Few Lines and Few Planes
- Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, A. Ravsky, O. Verbitsky, A. Wolff
- Mathematics, Computer ScienceWADS
- 5 July 2016
This work investigates the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes, and shows lower and upper bounds for the numbers of lines and planes needed for covering drawings of graphs in certain graph classes.