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

Bounding the mim‐width of hereditary graph classes

  • Published:2021-08-25 Issue:1 Volume:99 Page:117-151
  • ISSN:0364-9024
  • Container-title:Journal of Graph Theory
  • language:en
  • Short-container-title:J Graph Theory

Author:

Brettell Nick1ORCID,Horsfield Jake2ORCID,Munaro Andrea3ORCID,Paesani Giacomo4ORCID,Paulusma Daniël4ORCID

Affiliation:

1. School of Mathematics and Statistics Victoria University of Wellington Wellington New Zealand

2. School of Computing University of Leeds Leeds UK

3. School of Mathematics and Physics Queen's University Belfast Belfast UK

4. Department of Computer Science Durham University Durham UK

Funder

Leverhulme Trust

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference49 articles.

1. Graph classes with structured neighborhoods and algorithmic applications

2. More applications of the d‐neighbor equivalence: Connectivity and acyclicity constraints;Bergougnoux B.;Proc. ESA 2019, LIPIcs,2019

3. Node multiway cut and subset feedback vertex set on graphs of bounded mim‐width;Bergougnoux B.;Proc. WG 2020, LNCS,2020

4. Tight bounds on maximal and maximum matchings

5. Clique-Width for Graph Classes Closed under Complementation

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

1. On d-stable locally checkable problems parameterized by mim-width;Discrete Applied Mathematics;2024-04

2. Solving problems on generalized convex graphs via mim-width;Journal of Computer and System Sciences;2024-03

3. Treewidth versus clique number. II. Tree-independence number;Journal of Combinatorial Theory, Series B;2024-01

4. Clique‐width: Harnessing the power of atoms;Journal of Graph Theory;2023-07-10

5. On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs;Theoretical Computer Science;2023-04
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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