Complexity of two coloring problems in cubic planar bipartite mixed graphs

被引:4
|
作者
Ries, B. [1 ]
机构
[1] Univ Warwick, DIMAP, Coventry CV4 7AL, W Midlands, England
关键词
Mixed graph coloring; Computational complexity; List coloring; Bipartite graph; Scheduling; PRECEDENCE CONSTRAINTS;
D O I
10.1016/j.dam.2009.10.016
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this note we consider two coloring problems in mixed graphs, i.e., graphs containing edges and arcs, which arise from scheduling problems where disjunctive and precedence constraints have to be taken into account. We show that they are both NP-complete in cubic planar bipartite mixed graphs, which strengthens some results of Ries and de Werra (2008)[9]. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:592 / 596
页数:5
相关论文
共 50 条
  • [1] Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
    de Werra, D.
    Demange, M.
    Escoffier, B.
    Monnot, J.
    Paschos, V. Th.
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 819 - 832
  • [2] Hard coloring problems in low degree planar bipartite graphs
    Chlebik, Miroslav
    Chlebikova, Janka
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (14) : 1960 - 1965
  • [3] Weighted Coloring on planar, bipartite and split graphs: Complexity and improved approximation
    de Werra, D
    Demange, M
    Escoffier, B
    Monnot, J
    Paschos, VT
    [J]. ALGORITHMS AND COMPUTATION, 2004, 3341 : 896 - 907
  • [4] Star Coloring Bipartite Planar Graphs
    Kierstead, H. A.
    Kuendgen, Andre
    Timmons, Craig
    [J]. JOURNAL OF GRAPH THEORY, 2009, 60 (01) : 1 - 10
  • [5] On two coloring problems in mixed graphs
    Ries, B.
    de Werra, D.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (03) : 712 - 725
  • [6] ON THE COMPLEXITY OF COLORING BY SUPERDIGRAPHS OF BIPARTITE GRAPHS
    BANGJENSEN, J
    HELL, P
    MACGILLIVRAY, G
    [J]. DISCRETE MATHEMATICS, 1992, 109 (1-3) : 27 - 44
  • [7] On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs
    Nagy-Gyorgy, Judit
    [J]. ACTA CYBERNETICA, 2018, 23 (03): : 929 - 938
  • [8] Coloring Problems on Bipartite Graphs of Small Diameter
    Campos, Victor A.
    Gomes, Guilherme C. M.
    Ibiapina, Allen
    Lopes, Raul
    Sau, Ignasi
    Silva, Ana
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (02):
  • [9] Legally (Δ+2)-Coloring Bipartite Outerplanar Graphs in Cubic Time
    Huang, Danjun
    Lih, Ko-Wei
    Wang, Weifan
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 617 - 632
  • [10] Polychromatic 4-coloring of cubic bipartite plane graphs
    Horev, Elad
    Katz, Matthew J.
    Krakovski, Roi
    Nakamoto, Atsuhiro
    [J]. DISCRETE MATHEMATICS, 2012, 312 (04) : 715 - 719