Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph

Published:1999-06 Issue:2-3 Volume:92 Page:149-155
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Enomoto Hikoe,Miyauchi Miki Shimabara,Ota Katsuhiro

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference9 articles.

1. G.A. Atneosen, On the embeddability of compacta in N-books, Ph.D. Thesis, Michigan State Univ., 1968.

2. The book thickness of a graph;Bernhart;J. Combin. Theory Ser. B,1979

3. Embedding graphs in books: A layout problem with applications to VLSI design;Chung;SIAM J. Algebra Discrete Meth.,1987

4. H. Enomoto, M.S. Miyauchi, Embedding a graph into a 3-page book with O(mlogn) edge-crossings over the spine, Preprint.

5. On the pagenumber of complete bipartite graphs;Enomoto;J. Combin. Theory Ser. B,1997

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Upward Book Embeddability of st-Graphs: Complexity and Algorithms;Algorithmica;2023-07-14

2. A survey on book-embedding of planar graphs;Frontiers of Mathematics in China;2022-04

3. Topological Stack-Queue Mixed Layouts of Graphs;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-02-01

4. Defective Colouring of Graphs Excluding A Subgraph or Minor;Combinatorica;2018-08-14

5. Sparsity and Dimension;Combinatorica;2017-08-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP