ON THE COMPLEXITY OF COLORING BY SUPERDIGRAPHS OF BIPARTITE GRAPHS

被引:15
|
作者
BANGJENSEN, J
HELL, P
MACGILLIVRAY, G
机构
[1] SIMON FRASER UNIV,SCH COMP SCI,BURNABY V5A 1S6,BC,CANADA
[2] UNIV REGINA,DEPT MATH & STAT,REGINA S4S 0A2,SASKATCHEWAN,CANADA
关键词
D O I
10.1016/0012-365X(92)90276-L
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let H be a directed graph whose vertices are called colours. An H-colouring of a digraph G is an assignment of these colours to the vertices of G so that if g is adjacent to g' in G then colour(g) is adjacent to colour(g') in H (i.e., a homomorphism G --> H). In this paper we continue the study of the H-colouring problem, that is, the decision problem 'Is there an H-colouring of a given digraph G?' It follows from a result of Hell and Nesetril that this problem is NP-complete whenever H contains a symmetric odd cycle. We consider digraphs for which the symmetric part of H is bipartite, that is, digraphs H which can be constructed from the equivalence digraph of an undirected bipartite graph by adding some arcs. We establish some sufficient conditions for these H-colouring problems to be NP-complete. A complete classification is established for the subclass of 'partitionable digraphs', which we introduce.
引用
收藏
页码:27 / 44
页数:18
相关论文
共 50 条
  • [31] Coloring Problems on Bipartite Graphs of Small Diameter
    Campos, Victor A.
    Gomes, Guilherme C. M.
    Ibiapina, Allen
    Lopes, Raul
    Sau, Ignasi
    Silva, Ana
    ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (02):
  • [32] Injective coloring of some subclasses of bipartite graphs and chordal graphs
    Panda, B. S.
    Priyamvada
    DISCRETE APPLIED MATHEMATICS, 2021, 291 : 68 - 87
  • [33] Sum Coloring of Bipartite Graphs with Bounded Degree
    Michal Malafiejski
    Krzysztof Giaro
    Robert Janczewski
    Marek Kubale
    Algorithmica , 2004, 40 : 235 - 244
  • [34] b-coloring of some bipartite graphs
    Blidia, Mostafa
    Eschouf, Noureddine Ikhlef
    Maffray, Frederic
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2012, 53 : 67 - 76
  • [36] Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors
    Kuo, Ching-Chen
    Lu, Hsueh-I
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 24 - 33
  • [37] Conflict-free coloring on subclasses of perfect graphs and bipartite graphs
    Bhyravarapu, Sriram
    Kalyanasundaram, Subrahmanyam
    Mathew, Rogers
    THEORETICAL COMPUTER SCIENCE, 2025, 1031
  • [38] Complexity of Total Dominator Coloring in Graphs
    Michael A. Henning
    Arti Kusum
    Kaustav Pandey
    Graphs and Combinatorics, 2023, 39
  • [39] Coloring complete bipartite graphs from random lists
    Krivelevich, Michael
    Nachmias, Asaf
    RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (04) : 436 - 449
  • [40] ON INCIDENCE COLORING OF COMPLETE MULTIPARTITE AND SEMICUBIC BIPARTITE GRAPHS
    Janczewski, Robert
    Malafiejski, Michal
    Malafiejska, Anna
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (01) : 107 - 119