Choosability on H-free graphs

被引：3
|
作者：
Golovach, Petr A. [1 ]
Heggernes, Pinar [1 ]
van't Hof, Pim [1 ]
Paulusma, Daniel [2 ]
机构：
[1] Univ Bergen, Dept Informat, N-5020 Bergen, Norway
[2] Univ Durham, Sch Engn & Comp Sci, Durham DH1 3HP, England
来源：
INFORMATION PROCESSING LETTERS | 2013年 / 113卷 / 04期
基金：
欧洲研究理事会; 英国工程与自然科学研究理事会;
关键词：
Computational complexity; Choosability; H-free graphs; Linear forest; CHOICE NUMBER; COLORING GRAPHS; NP-COMPLETENESS; PLANAR GRAPH; COMPLEXITY;
D O I：
10.1016/j.ipl.2012.12.003
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A graph is H-free if it has no induced subgraph isomorphic to H. We determine the computational complexity of the CHOOSABILITY problem restricted to H-free graphs for every graph H that does not belong to {K-1,K-3, P-1 + P-2, P-1 + P-3, P-4}. We also show that if H is a linear forest, then the problem is fixed-parameter tractable when parameterized by k. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：107 / 110
页数：4
相关论文
共 50 条
  • [41] On the complexity of matching cut for graphs of bounded radius and H-free graphs
    Lucke, Felicia
    Paulusma, Daniel
    Ries, Bernard
    THEORETICAL COMPUTER SCIENCE, 2022, 936 : 33 - 42
  • [42] Disjoint Paths and Connected Subgraphs for H-Free Graphs
    Kern, Walter
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    van Leeuwen, Erik Jan
    COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 414 - 427
  • [43] Parameterized Inapproximability of Independent Set in H-Free Graphs
    Pavel Dvořák
    Andreas Emil Feldmann
    Ashutosh Rai
    Paweł Rzążewski
    Algorithmica, 2023, 85 : 902 - 928
  • [44] Computing Subset Vertex Covers in H-Free Graphs
    Brettell, Nick
    Oostveen, Jelle J.
    Pandey, Sukanya
    Paulusma, Daniel
    van Leeuwen, Erik Jan
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2023, 2023, 14292 : 88 - 102
  • [45] Few induced disjoint paths for H-free graphs
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    Leeuwen, Erik Jan van
    THEORETICAL COMPUTER SCIENCE, 2023, 939 : 182 - 193
  • [46] Disjoint paths and connected subgraphs for H-free graphs
    Kern, Walter
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    van Leeuwen, Erik Jan
    THEORETICAL COMPUTER SCIENCE, 2022, 898 : 59 - 68
  • [47] Computing Weighted Subset Transversals in H-Free Graphs
    Brettell, Nick
    Johnson, Matthew
    Paulusma, Daniel
    ALGORITHMS AND DATA STRUCTURES, WADS 2021, 2021, 12808 : 229 - 242
  • [48] Parameterized Inapproximability of Independent Set in H-Free Graphs
    Dvorak, Pavel
    Feldmann, Andreas Emil
    Rai, Ashutosh
    Rzazewski, Pawel
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2020, 2020, 12301 : 40 - 53
  • [49] Parameterized Complexity of Independent Set in H-Free Graphs
    Édouard Bonnet
    Nicolas Bousquet
    Pierre Charbit
    Stéphan Thomassé
    Rémi Watrigant
    Algorithmica, 2020, 82 : 2360 - 2394
  • [50] For Most Graphs H, Most H-Free Graphs Have a Linear Homogeneous Set
    Kang, Ross J.
    McDiarmid, Colin
    Reed, Bruce
    Scott, Alex
    RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (03) : 343 - 361
12345