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

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path

  • Published:2021-01 Issue: Volume:850 Page:98-115
  • ISSN:0304-3975
  • Container-title:Theoretical Computer Science
  • language:en
  • Short-container-title:Theoretical Computer Science

Author:

Bonomo-Braberman Flavia,Chudnovsky Maria,Goedgebeur Jan,Maceli Peter,Schaudt Oliver,Stein Maya,Zhong MingxianORCID

Funder

ANPCyT

UBACyT

PROGAMA REGIONAL MATHAMSUD

NSF

Research Foundation Flanders

FONDECYT

CONICYT + PIA/Apoyo a centros científicos y tecnológicos de excelencia con financiamiento Basal

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference28 articles.

1. Three-coloring and list three-coloring of graphs without induced paths on seven vertices;Bonomo;Combinatorica,2018

2. A certifying algorithm for 3-colorability of P5-free graphs;Bruce,2009

3. Obstructions for three-coloring graphs without induced paths on six vertices;Chudnovsky;J. Comb. Theory, Ser. B,2020

4. Obstructions for three-coloring and list three-coloring H-free graphs;Chudnovsky;SIAM J. Discrete Math.,2020

5. The strong perfect graph theorem;Chudnovsky;Ann. Math.,2006

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

1. Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs;Discrete Applied Mathematics;2024-02

2. 3-Colouring $$P_t$$-Free Graphs Without Short Odd Cycles;Algorithmica;2022-10-17

3. On 3-Coloring of ($$2P_4,C_5$$)-Free Graphs;Algorithmica;2022-02-15

4. On 3-Coloring of $$(2P_4,C_5)$$-Free Graphs;Graph-Theoretic Concepts in Computer Science;2021
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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