Results 271 to 280 of about 3,644,444 (342)

Book Embedding of Toroidal Bipartite Graphs

SIAM Journal on Discrete Mathematics, 2012
Endo proved that every toroidal graph has a book embedding with at most seven pages. In this paper, we prove that every toroidal bipartite graph has a book embedding with at most five pages. In order to do so, we prove that every bipartite torus quadrangulation Q with n vertices admits two disjoint noncontractible simple closed curves cutting the torus
Atsuhiro Nakamoto   +2 more
openaire   +2 more sources

One-Page Book Embedding under Vertex-Neighborhood Constraints

SIAM Journal on Discrete Mathematics, 1990
Summary: The VLSI-related problem of embedding graphs in books is studied. A book embedding of a graph \(G=(V,E)\) consists of two parts, namely, (1) an ordering of \(V\) along the spine of the book, and (2) an assignment of each \(e\in E\) to a page of the book, so that edges assigned to the same page do not intersect.
Moran, Shlomo, Wolfstahl, Yaron
openaire   +3 more sources

Home - About - Disclaimer - Privacy