Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

It is proved that any plane graph may be represented by a triangle contact system, that is a
collection of triangular disks which are disjoint except at contact points, each contact point …

Given a set S of segments in the plane, the intersection graph of S is the graph with vertex
set S in which two vertices are adjacent if and only if the corresponding two segments …

Acyclic orientations with exactly one source and one sink—the so-called bipolar orientations-
arise in many graph algorithms and specially in graph drawing. The fundamental properties …

Practical applications, like radio frequency assignments, led to the definition of disk
intersection graphs in the plane, called shortly disk graphs. If the disks in the representation …

Consider a drawing of a graph G in the plane such that crossing edges are coloured
differently. The minimum number of colours, taken over all drawings of G, is the classical …

The⌞-intersection graphs are the graphs that have a representation as intersection graphs
of axis-parallel⌞ shapes in the plane. A subfamily of these graphs are {⌞,|,–}-contact graphs …

We investigate the class of vertex intersection graphs of paths on a grid, and specifically
consider the subclasses that are obtained when each path in the representation has at most …

This article focuses on a combinatorial structure specific to triangulated plane graphs with
quadrangular outer face and no separating triangle, which are called irreducible …

We give an O (| V (G)|)-time algorithm to assign vertical and horizontal segments to the
vertices of any bipartite plane graph G so that (i) no two segments have an interior point in …