On the complexity of H-colouring planar graphs

被引：9
|
作者：
MacGillivray, G. [1 ]
Siggers, M. [1 ]
机构：
[1] Univ Victoria, Dept Math & Stat, Victoria, BC V8W 3P4, Canada
来源：
DISCRETE MATHEMATICS | 2009年 / 309卷 / 18期
关键词：
Graph homomorphism; H-colouring; Planar graph; NP-completeness;
D O I：
10.1016/j.disc.2008.05.016
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We show that if H is an odd-cycle, or any non-bipartite graph of girth 5 and maximum degree at most 3, then planar H-COL is NP-complete. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：5729 / 5738
页数：10
相关论文
共 50 条
  • [1] The complexity of H-colouring of bounded degree graphs
    Galluccio, A
    Hell, P
    Nesetril, J
    DISCRETE MATHEMATICS, 2000, 222 (1-3) : 101 - 109
  • [2] H-colouring bipartite graphs
    Engbers, John
    Galvin, David
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (03) : 726 - 742
  • [3] H-colouring dichotomy in proof complexity
    Gaysin, Azza
    JOURNAL OF LOGIC AND COMPUTATION, 2021, 31 (05) : 1206 - 1225
  • [4] A complexity dichotomy for signed H-colouring
    Brewster, Richard C.
    Siggers, Mark
    DISCRETE MATHEMATICS, 2018, 341 (10) : 2768 - 2773
  • [5] H-colouring Pt-free graphs in subexponential time
    Groenland, Carla
    Okrasa, Karolina
    Rzazewski, Pawel
    Scott, Alex
    Seymour, Paul
    Spirkl, Sophie
    DISCRETE APPLIED MATHEMATICS, 2019, 267 : 184 - 189
  • [6] Dichotomy for bounded degree H-colouring
    Siggers, Mark H.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (02) : 201 - 210
  • [7] On the complexity of role colouring planar graphs, trees and cographs
    Purcell, Christopher
    Rombach, Puck
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 35 : 1 - 8
  • [8] Filling the complexity gaps for colouring planar and bounded degree graphs
    Dabrowski, Konrad K.
    Dross, Francois
    Johnson, Matthew
    Paulusma, Daniel
    JOURNAL OF GRAPH THEORY, 2019, 92 (04) : 377 - 393
  • [9] Surjective H-Colouring: New Hardness Results
    Golovach, Petr A.
    Johnson, Matthew
    Martin, Barnaby
    Paulusma, Daniel
    Stewart, Anthony
    UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017, 2017, 10307 : 270 - 281
  • [10] Surjective H-Colouring over Reflexive Digraphs
    Larose, Benoit
    Martin, Barnaby
    Paulusma, Daniel
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (01)
12345