Short proofs of coloring theorems on planar graphs-Reference-Cited by-同舟云学术

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

Short proofs of coloring theorems on planar graphs

Published:2014-02 Issue: Volume:36 Page:314-321
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Borodin Oleg V.,Kostochka Alexandr V.,Lidický Bernard,Yancey Matthew

Funder

Russian Foundation for Basic Research

NSF

National Science Foundation

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference30 articles.

1. On continuation of 3-colouring of planar graphs;Aksenov;Diskret. Anal. Novosibirsk,1974

2. Chromatic connected vertices in planar graphs;Aksenov;Diskret. Anal.,1977

3. On the continuation of a 3-coloring from two vertices in a plane graph without 3-cycles;Aksenov;Diskretn. Anal. Issled. Oper. Ser. 1,2002

4. A new proof of Grünbaum’s 3 color theorem;Borodin;Discrete Math.,1997

5. Colorings of plane graphs: a survey;Borodin;Discrete Math.,2013

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

1. Further extensions of the Grötzsch Theorem;Discrete Mathematics;2022-06

2. Adynamic coloring of graphs;Discrete Applied Mathematics;2020-09

3. Note on 3-choosability of planar graphs with maximum degree 4;Discrete Mathematics;2019-11

4. A Brooks-Type Result for Sparse Critical Graphs;Combinatorica;2018-03-05

5. 3-coloring triangle-free planar graphs with a precolored 9-cycle;European Journal of Combinatorics;2018-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP