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: | Blankenship, Robin Leigh |
---|---|
Other Authors: | Robert Lax |
Format: | Others |
Language: | en |
Published: |
LSU
2003
|
Subjects: | |
Online Access: | http://etd.lsu.edu/docs/available/etd-0709103-163907/ |
Similar Items
-
Graph embeddings and approximate graph coloring
by: Labelle, François.
Published: (2000) -
Full embeddings and the category of graphs
by: Mendelsohn, Eric.
Published: (1968) -
Book-Embeddings in Graphs
by: I-Fan Sun, et al.
Published: (2001) -
Embedding K? in 4-connected graphs /
by: Randby, Scott P.
Published: (1991) -
Embedding Problems for Graphs and Hypergraphs
by: Cooley, Oliver Josef Nikolaus
Published: (2010)