Premium
Rectilinear drawings of graphs
Author(s) -
Thomassen Carsten
Publication year - 1988
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190120306
Subject(s) - combinatorics , mathematics , enhanced data rates for gsm evolution , 1 planar graph , dual (grammatical number) , dual graph , plane (geometry) , indifference graph , pathwidth , chordal graph , planar graph , discrete mathematics , line graph , graph , geometry , computer science , artificial intelligence , art , literature
We consider graphs drawn in the plane such that every edge crosses at most one other edge. We characterize, in terms of two forbidden sub‐configurations, which of these graphs are equivalent to drawings such that all edges are straight line segments. As a consequence we obtain a complete characterization of the pairs of dual graphs that can be represented as geometric dual graphs such that all edges except one are straight line segments.