Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph-Reference-Cited by-同舟云学术

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

Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph

Published:2015-01 Issue: Volume:43 Page:98-123
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Wang Yingqian,Xu Jinghan

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference35 articles.

1. On small faces in 4-critical graphs;Abbott;Ars Combin.,1991

2. Covering planar graphs with forests;Balogh;J. Combin. Theory Ser. B,2005

3. Graph Theory;Bondy,2008

4. Structural properties of plane graphs without adjacent triangles and an application to 3-colorings;Borodin;J. Graph Theory,1996

5. A sufficient condition for plane graphs to be 3-colorable;Borodin;Diskretn. Anal. Issled. Oper.,2004

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

1. Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph;Journal of Applied Mathematics and Computing;2024-03-12

2. Colorings of plane graphs without long monochromatic facial paths;Discussiones Mathematicae Graph Theory;2021

3. Every planar graph without triangles adjacent to cycles of length 3 or 6 is (1,1,1)-colorable;Discrete Mathematics;2020-06

4. Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph;Discrete Applied Mathematics;2019-09

5. Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable;Discrete Mathematics;2018-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3