A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system-Reference-Cited by-同舟云学术

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

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system

Published:2013-11 Issue: Volume:513 Page:65-76
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Eades Peter,Hong Seok-Hee,Katoh Naoki,Liotta Giuseppe,Schweitzer Pascal,Suzuki Yusuke

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. On 1-planar graphs with rotation systems;Auer,2012

2. Upward drawings of triconnected digraphs;Bertolazzi;Algorithmica,1994

3. Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs;Borodin;Metody Diskretn. Anal.,1984

4. Acyclic colouring of 1-planar graphs;Borodin;Discrete Appl. Math.,2001

5. On the density of maximal 1-planar graphs;Brandenburg,2012

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

1. Edge‐minimum saturated k‐planar drawings;Journal of Graph Theory;2024-03-28

2. Maximal 1-plane graphs with dominating vertices;Applied Mathematics and Computation;2023-11

3. A key review on graph data science: The power of graphs in scientific studies;Chemometrics and Intelligent Laboratory Systems;2023-09

4. 1-planarity testing and embedding: An experimental study;Computational Geometry;2023-01

5. The Density of Fan-Planar Graphs;The Electronic Journal of Combinatorics;2022-02-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP