Book embeddings of graphs and a theorem of Whitney
Combinatorics
2021-10-05 v1
Abstract
It is shown that the number of pages required for a book embedding of a graph is the maximum of the numbers needed for any of the maximal nonseparable subgraphs and that a plane graph in which every triangle bounds a face has a two-page book embedding. The latter extends a theorem of H. Whitney and gives two-page book embeddings for -trees and square grids.
Cite
@article{arxiv.2110.00820,
title = {Book embeddings of graphs and a theorem of Whitney},
author = {Paul C. Kainen and Shannon Overbay},
journal= {arXiv preprint arXiv:2110.00820},
year = {2021}
}
Comments
8 pages