Book Embeddings of Graphs
We use a structural theorem of Robertson and Seymour to show that for every minor-closed class of graphs, other than the class of all graphs, there is a number <i>k</i> such that every member of the class can be embedded in a book with <i>k</i> pages. Book embeddings of graph...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en |
Published: |
LSU
2003
|
Subjects: | |
Online Access: | http://etd.lsu.edu/docs/available/etd-0709103-163907/ |