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
6.7. REALIZER METHOD 213
1. In each spanning tree, the edges of G are directed from children to parent.
2. The sinks (roots) of the spanning trees are the three external vertices of G.
3. Each internal edge of G is contained in one spanning tree.
4. Each external edge of G is contained in two spanning trees and it has different
directions in the two trees.
5. Consider the edges of G with the directions they have in the three spanning trees
(the external edges are considered twice):
(a) Each non-sink vertex v of G has exactly three outgoing edges; the circular
order of the outgoing edges around v induces a circular order of the spanning
trees around v
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