Embedding a Graph into a d+1-page Book with ⌈mlog_dn⌉ Edge-crossings over the Spine(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
A topological book embedding of a graph is an embedding in a book that carries the vertices in the spine of the book and the edges in the pages; edges are allowed to cross the spine. Enomoto showed that for any graph G having n vertices, there exists a three-page book embedding of G in which each edge crosses the spine ⌈logn⌉ times. This paper generalizes the result and shows that for any graph G having n vertices, there exists a d+1-page book embedding of G in which each edge crosses the spine ⌈log_dn⌉ times.
- 一般社団法人電子情報通信学会の論文
- 2005-05-01