Skip to Content
Handbook of Graph Drawing and Visualization
book

Handbook of Graph Drawing and Visualization

by Roberto Tamassia
August 2013
Intermediate to advanced content levelIntermediate to advanced
862 pages
32h 20m
English
Chapman and Hall/CRC
Content preview from Handbook of Graph Drawing and Visualization
14.4. THICKNESS 475
only if it is outerplanar [BK79]. Bernhart and Kainen [BK79] proved that a graph has book
thickness at most two if and only if it is a subgr aph of a Hamiltonian planar graph. Unlike
thickness, being able to partition the edge set of a graph G into k outerplanar subgraphs
does not imply that G has book thickness at most k. For example, the edge set of K
5
can
be partitioned into two cycles, yet K
5
has book thickness more than two, since it is not a
subgraph of a Hamiltonian planar graph. The situation is similar for geometric thickness
as will soon become clear.
Book embeddings, first de fin ed by Ollmann [Oll73], are ubiquitous struct ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Handbook of Graph Theory, 2nd Edition

Handbook of Graph Theory, 2nd Edition

Jonathan L. Gross, Jay Yellen, Ping Zhang
Drawing Product Ideas

Drawing Product Ideas

Kent E. Eisenhuth, Manuel Lima

Publisher Resources

ISBN: 9781420010268