(Circular) backbone colouring: Forest backbones in planar graphs

被引:8
|
作者
Havet, Frederic [1 ,2 ,3 ]
King, Andrew D. [4 ,5 ]
Liedloff, Mathieu [6 ]
Todinca, Loan [6 ]
机构
[1] UNSA, CNRS I3S, Projet Coati, Paris, France
[2] INRIA Sophia Antipolis, Sophia Antipolis, France
[3] Simon Fraser Univ, PIMS, UMI 3069, CNRS, Burnaby, BC V5A 1S6, Canada
[4] Simon Fraser Univ, Dept Math, Burnaby, BC V5A 1S6, Canada
[5] Simon Fraser Univ, Dept Comp Sci, Burnaby, BC V5A 1S6, Canada
[6] Univ Orleans, Lab Informat Fondamentale Orleans, Orleans, France
基金
加拿大自然科学与工程研究理事会;
关键词
Backbone colouring; Planar graph; Tree backbone; NP-complete;
D O I
10.1016/j.dam.2014.01.011
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Consider an undirected graph G and a subgraph H of G, on the same vertex set. The q-backbone chromatic number BBCq(G, H) is the minimum k such that G can be properly coloured with colours from {1,...,k}, and moreover for each edge of H, the colours of its ends differ by at least q. In this paper we focus on the case when G is planar and H is a forest. We give a series of NP-hardness results as well as upper bounds for BBCq(G, H), depending on the type of the forest (matching, galaxy, spanning tree). Eventually, we discuss a circular version of the problem. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:119 / 134
页数:16
相关论文
共 50 条
  • [1] Backbone colouring: Tree backbones with small diameter in planar graphs
    Campos, Victor
    Havet, Frederic
    Sampaio, Rudini
    Silva, Ana
    THEORETICAL COMPUTER SCIENCE, 2013, 487 : 50 - 64
  • [2] Circular backbone colorings: On matching and tree backbones of planar graphs
    Araujo, J.
    Benevides, F.
    Cezar, A.
    Silva, A.
    DISCRETE APPLIED MATHEMATICS, 2018, 251 : 69 - 82
  • [3] The computational complexity of the backbone coloring problem for planar graphs with connected backbones
    Janczewski, Robert
    Turowski, Krzysztof
    DISCRETE APPLIED MATHEMATICS, 2015, 184 : 237 - 242
  • [4] List backbone colouring of graphs
    Bu, Yuehua
    Finbow, Stephen
    Liu, Daphne Der-Fen
    Zhu, Xuding
    DISCRETE APPLIED MATHEMATICS, 2014, 167 : 45 - 51
  • [5] List circular backbone colouring
    1600, Discrete Mathematics and Theoretical Computer Science (16):
  • [6] List circular backbone colouring
    Havet, Frederic
    King, Andrew D.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2014, 16 (01): : 89 - 104
  • [7] Backbone coloring of graphs with galaxy backbones
    Araújo, C.S.
    Araújo, J.
    Silva, A.
    Cezar, A.A.
    Discrete Applied Mathematics, 2022, 323 : 2 - 13
  • [8] Backbone coloring of graphs with galaxy backbones
    Araujo, C. S.
    Araujo, J.
    Silva, A.
    Cezar, A. A.
    DISCRETE APPLIED MATHEMATICS, 2022, 323 : 2 - 13
  • [9] Backbone Coloring of Graphs with Galaxy Backbones
    Araujo, Camila
    Araujo, Julio
    Silva, Ana
    Cezar, Alexandre
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 53 - 64
  • [10] Colouring and labelling of planar graphs
    Van den Heuvel, Y
    McGuinness, S
    ELECTROMAGNETIC COMPATIBILITY 1998, 1998, : 712 - 715