Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
Author:
Affiliation:
1. CNRS, LaBRI Université de Bordeaux Bordeaux France
2. School of Computing University of Leeds Leeds UK
3. Computer Science Institute Charles University Prague Czech Republic
4. Department of Computer Science Durham University Durham UK
Funder
Leverhulme Trust
London Mathematical Society
Engineering and Physical Sciences Research Council
Publisher
Wiley
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Link
https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22683
Reference49 articles.
1. Improved algorithms and combinatorial bounds for independent feedback vertex set;Agrawal A.;Proc. IPEC 2016, LIPIcs,2017
2. Brooks' vertex‐colouring theorem in linear time;Baetz B.;CoRR. abs/1401.8023,2014
3. Recognizing graphs close to bipartite graphs;Bonamy M.;Proc. MFCS 2017, LIPIcs,2017
4. Independent feedback vertex sets for graphs of bounded diameter
5. Independent Feedback Vertex Set for $$P_5$$ P 5 -Free Graphs
Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the price of independence for vertex cover, feedback vertex set and odd cycle transversal;European Journal of Combinatorics;2024-03
2. Partitioning into degenerate graphs in linear time;European Journal of Combinatorics;2023-12
3. Partitioning P4-tidy graphs into a stable set and a forest;Discrete Applied Mathematics;2023-10
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3