Quasiplanar graphs, string graphs, and the Erdős–Gallai problem-Reference-Cited by-同舟云学术

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

Quasiplanar graphs, string graphs, and the Erdős–Gallai problem

Published:2023-10 Issue: Volume: Page:103811
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Fox Jacob,Pach János,Suk Andrew

Funder

Austrian Science Fund

NKFIH

Nemzeti Kutatási Fejlesztési és Innovációs Hivatal

National Science Foundation

David and Lucile Packard Foundation

NSF

Engineering Research Centers

European Research Council

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference40 articles.

1. On the maximum number of edges in topological graphs with no four pairwise crossing edges;Ackerman;Discrete Comput. Geom.,2009

2. Quasi-planar graphs;Ackerman,2020

3. On the maximum number of edges in quasi-planar graphs;Ackerman;J. Combin. Theory Ser. A,2007

4. Quasi-planar graphs have a linear number of edges;Agarwal;Combinatorica,1997

5. On a coloring problem;Asplund;Math. Scand.,1960

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP