(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

来源：

DISCRETE APPLIED MATHEMATICS | 2014年 / 169卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

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 条

[41] Drawing planar graphs with circular arcs
Cheng, CC
Duncan, CA
Goodrich, MT
Kobourov, SG
DISCRETE & COMPUTATIONAL GEOMETRY, 2001, 25 (03) : 405 - 418
[42] Circular planar graphs and resistor networks
Curtis, EB
Ingerman, D
Morrow, JA
LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 283 (1-3) : 115 - 150
[43] Backbone coloring of planar graphs without special circles
Bu, Yuehua
Li, Yulin
THEORETICAL COMPUTER SCIENCE, 2011, 412 (46) : 6464 - 6468
[44] Backbone coloring of planar graphs without special circles
College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua, Zhejiang, 321004, China
Theor Comput Sci, 46 (6464-6468):
[45] Backbone coloring for triangle-free planar graphs
Yue-hua Bu
Shui-ming Zhang
Acta Mathematicae Applicatae Sinica, English Series, 2017, 33 : 819 - 824
[46] Backbone Coloring for Triangle-free Planar Graphs
Yue-hua BU
Shui-ming ZHANG
Acta Mathematicae Applicatae Sinica, 2017, 33 (03) : 819 - 824
[47] Backbone coloring for triangle-free planar graphs
Bu, Yue-hua
Zhang, Shui-ming
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2017, 33 (03): : 819 - 824
[48] The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
Janczewski, Robert
Turowski, Krzysztof
INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 232 - 236
[49] Tree-like distance colouring for planar graphs of sufficient girth
Kang, Ross J.
van Loon, Willem
ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (01):
[50] AN ORIENTED 7-COLOURING OF PLANAR GRAPHS WITH GIRTH AT LEAST 7
Borodin, O. V.
Ivanova, A. O.
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2005, 2 : 222 - 229

← 1 2 3 4 5 →