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 条
  • [1] On Switching to H-Free Graphs
    Jelinkova, Eva
    Kratochvil, Jan
    [J]. GRAPH TRANSFORMATIONS, ICGT 2008, 2008, 5214 : 379 - 395
  • [2] On Switching to H-Free Graphs
    Jelinkova, Eva
    Kratochvil, Jan
    [J]. JOURNAL OF GRAPH THEORY, 2014, 75 (04) : 387 - 405
  • [3] Counting H-free graphs
    Promel, HJ
    Steger, A
    [J]. DISCRETE MATHEMATICS, 1996, 154 (1-3) : 311 - 315
  • [4] MaxCut in H-free graphs
    Alon, N
    Krivelevich, M
    Sudakov, B
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (5-6): : 629 - 647
  • [5] Extremal H-free planar graphs
    Lan, Yongxin
    Shi, Yongtang
    Song, Zi-Xia
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (02):
  • [6] Counting H-free orientations of graphs
    Bucic, Matija
    Janzer, Oliver
    Sudakov, Benny
    [J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2023, 174 (01) : 79 - 95
  • [7] On Subgraph Complementation to H-free Graphs
    Dhanyamol Antony
    Jay Garchar
    Sagartanu Pal
    R. B. Sandeep
    Sagnik Sen
    R. Subashini
    [J]. Algorithmica, 2022, 84 : 2842 - 2870
  • [8] BIPARTITE SUBGRAPHS OF H-FREE GRAPHS
    Zeng, Qinghou
    Hou, Jianfeng
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2017, 96 (01) : 1 - 13
  • [9] Orthonormal Representations of H-Free Graphs
    Igor Balla
    Shoham Letzter
    Benny Sudakov
    [J]. Discrete & Computational Geometry, 2020, 64 : 654 - 670
  • [10] On Subgraph Complementation to H-free Graphs
    Antony, Dhanyamol
    Garchar, Jay
    Pal, Sagartanu
    Sandeep, R. B.
    Sen, Sagnik
    Subashini, R.
    [J]. ALGORITHMICA, 2022, 84 (10) : 2842 - 2870
12345