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 条
  • [31] Finding Matching Cuts in H-Free Graphs
    Felicia Lucke
    Daniël Paulusma
    Bernard Ries
    Algorithmica, 2023, 85 : 3290 - 3322
  • [32] Maximum bipartite subgraphs in H-free graphs
    Jing Lin
    Czechoslovak Mathematical Journal, 2022, 72 : 621 - 635
  • [33] Chromatic symmetric functions and H-free graphs
    Hamel, Angele M.
    Hoang, Chinh T.
    Tuero, Jake E.
    GRAPHS AND COMBINATORICS, 2019, 35 (04) : 815 - 825
  • [34] Partitioning H-free graphs of bounded diameter
    Brause, Christoph
    Golovach, Petr
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    THEORETICAL COMPUTER SCIENCE, 2022, 930 : 37 - 52
  • [35] Open Packing in H-free Graphs and Subclasses of Split Graphs
    Shalu, M. A.
    Kirubakaran, V. K.
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2024, 2024, 14508 : 239 - 251
  • [36] Dense H-free graphs are almost (χ(H)-1)-partite
    Allen, Peter
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [37] Many cliques in H-free subgraphs of random graphs
    Alon, Noga
    Kostochka, Alexandr
    Shikhelman, Clara
    JOURNAL OF COMBINATORICS, 2018, 9 (04) : 567 - 597
  • [38] Disjoint paths and connected subgraphs for H-free graphs
    Kern, Walter
    Martin, Barnaby
    Paulusma, Daniël
    Smith, Siani
    van Leeuwen, Erik Jan
    Theoretical Computer Science, 2022, 898 : 59 - 68
  • [39] Parameterized Complexity of Independent Set in H-Free Graphs
    Bonnet, Edouard
    Bousquet, Nicolas
    Charbit, Pierre
    Thomasse, Stephan
    Watrigant, Remi
    ALGORITHMICA, 2020, 82 (08) : 2360 - 2394
  • [40] Few Induced Disjoint Paths for H-Free Graphs
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    van Leeuwen, Erik Jan
    COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 89 - 101
12345