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 条
  • [21] Finding Matching Cuts in H-Free Graphs
    Lucke, Felicia
    Paulusma, Daniel
    Ries, Bernard
    ALGORITHMICA, 2023, 85 (10) : 3290 - 3322
  • [22] New results for MaxCut in H-free graphs
    Glock, Stefan
    Janzer, Oliver
    Sudakov, Benny
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2023, : 441 - 481
  • [23] MAXIMUM BIPARTITE SUBGRAPHS IN H-FREE GRAPHS
    Lin, Jing
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2022, 72 (03) : 621 - 635
  • [24] Minimum Degree Stability of H-Free Graphs
    Illingworth, Freddie
    COMBINATORICA, 2023, 43 (01) : 129 - 147
  • [25] Max-Bisections of H-free graphs
    Hou, Jianfeng
    Yan, Juan
    DISCRETE MATHEMATICS, 2020, 343 (0I)
  • [26] Partitioning H-free graphs of bounded diameter
    Brause, Christoph
    Golovach, Petr
    Martin, Barnaby
    Paulusma, Daniël
    Smith, Siani
    Theoretical Computer Science, 2022, 930 : 37 - 52
  • [27] Critical vertices and edges in H-free graphs
    Paulusma, Daniel
    Picouleau, Christophe
    Ries, Bernard
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 361 - 367
  • [28] Computing subset transversals in H-free graphs
    Brettell, Nick
    Johnson, Matthew
    Paesani, Giacomo
    Paulusma, Daniel
    THEORETICAL COMPUTER SCIENCE, 2022, 902 : 76 - 92
  • [29] Contraction and deletion blockers for perfect graphs and H-free graphs
    Diner, Oznur Yasar
    Paulusma, Daniel
    Picouleau, Christophe
    Ries, Bernard
    THEORETICAL COMPUTER SCIENCE, 2018, 746 : 49 - 72
  • [30] Many T copies in H-free graphs
    Alon, Noga
    Shikhelman, Clara
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 121 : 146 - 172
12345