COLOURING STABILITY TWO UNIT DISK GRAPHS

被引：0

作者：

Bruhn, Henning ^{[1
]}

机构：

[1] Univ Ulm, D-89069 Ulm, Germany

来源：

关键词：

Unit disk graphs; colouring; clique number; stability; CHANNEL ASSIGNMENT;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.

引用

页码：60 / 74

页数：15

共 50 条

[1] Improper colouring of (random) unit disk graphs
Kang, Ross J.
Muller, Tobias
Sereni, Jean-Sebastien
DISCRETE MATHEMATICS, 2008, 308 (08) : 1438 - 1454
[2] Approximate Strong Edge-Colouring of Unit Disk Graphs
Grelier, Nicolas
de Verclos, Remi de Joannis
Kang, Ross J.
Pirot, Francois
APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019), 2020, 11926 : 154 - 169
[3] Local edge colouring of yao-like subgraphs of unit disk graphs
Czyzowicz, J.
Dobrev, S.
Kranakis, E.
Opatrny, J.
Urrutia, J.
STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2007, 4474 : 195 - +
[4] Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
Czyzowicz, J.
Dobrev, S.
Kranakis, E.
Opatrny, J.
Urrutia, J.
THEORETICAL COMPUTER SCIENCE, 2009, 410 (14) : 1388 - 1400
[5] A tight bound for online colouring of disk graphs
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
THEORETICAL COMPUTER SCIENCE, 2007, 384 (2-3) : 152 - 160
[6] UNIT DISK GRAPHS
CLARK, BN
COLBOURN, CJ
JOHNSON, DS
DISCRETE MATHEMATICS, 1990, 86 (1-3) : 165 - 177
[7] Bisectored unit disk graphs
Nolan, J
NETWORKS, 2004, 43 (03) : 141 - 152
[8] Routing in Unit Disk Graphs
Kaplan, Haim
Mulzer, Wolfgang
Roditty, Liam
Seiferth, Paul
ALGORITHMICA, 2018, 80 (03) : 830 - 848
[9] On Coloring Unit Disk Graphs
A. Gräf
M. Stumpf
G. Weißenfels
Algorithmica, 1998, 20 : 277 - 293
[10] On coloring unit disk graphs
Graf, A
Stumpf, M
Weissenfels, G
ALGORITHMICA, 1998, 20 (03) : 277 - 293