Colouring stability two unit disk graphs
Combinatorics
2011-10-04 v1
Authors:
Henning Bruhn
Abstract
We prove that every stability two unit disk graph has chromatic number at most 3/2 times its clique number.
Keywords
Cite
@article{arxiv.1110.0037,
title = {Colouring stability two unit disk graphs},
author = {Henning Bruhn},
journal= {arXiv preprint arXiv:1110.0037},
year = {2011}
}
Related papers
View all related →
Combinatorics · Mathematics
Biclique Coverings and the Chromatic Number
Dhruv Mubayi, Sundar Vishwanathan
2009-03-19
Combinatorics · Mathematics
Revisiting a theorem by Folkman on graph colouring
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret +4
2020-03-24
Logic · Mathematics
On chromatic number of countable graphs
Hirotaka Kikyo, Koitaro Nakaura, Akito Tsuboi
2026-02-25
Combinatorics · Mathematics
Clique colourings of geometric graphs
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
2018-12-04
Computational Complexity · Computer Science
Complexity of Stability
Fabian Frei, Edith Hemaspaandra, Jörg Rothe
2020-12-15
Combinatorics · Mathematics
A note on uniquely 10-colorable graphs
Matthias Kriesell
2020-02-20
Computational Complexity · Computer Science
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Elaine M. Eschen, Chinh T. Hoang, R. Sritharan, Lorna Stewart
2009-07-06
Combinatorics · Mathematics
Circle graphs are quadratically $\chi$-bounded
James Davies, Rose McCarty
2020-12-30
Combinatorics · Mathematics
Colouring polygon visibility graphs and their generalizations
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
2021-03-16
Combinatorics · Mathematics
Planar graphs have two-coloring number at most 8
Zdeněk Dvořák, Adam Kabela, Tomáš Kaiser
2019-10-18
Combinatorics · Mathematics
Planar graphs are 9/2-colorable
Daniel W. Cranston, Landon Rabern
2019-11-18
Combinatorics · Mathematics
Large cliques in graphs with high chromatic number
Csaba Biró
2011-07-14
Combinatorics · Mathematics
Tight Bounds on the Clique Chromatic Number
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
2021-09-13
Combinatorics · Mathematics
Improved bounds for colouring circle graphs
James Davies
2022-02-18
Combinatorics · Mathematics
Clique coloring of dense random graphs
Noga Alon, Michael Krivelevich
2017-11-07
Combinatorics · Mathematics
The list chromatic number of graphs with small clique number
Michael Molloy
2018-07-02
Combinatorics · Mathematics
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
Christopher Duffy, Fabien Jacques, Mickael Montassier, Alexandre Pinlou
2020-09-14
Combinatorics · Mathematics
Stability with minuscule structure for chromatic thresholds
Jaehoon Kim, Hong Liu, Chong Shangguan, Guanghui Wang +2
2026-02-24
Combinatorics · Mathematics
Tight asymptotics of clique-chromatic numbers of dense random graphs
Yury Demidovich, Maksim Zhukovskii
2022-12-05
Combinatorics · Mathematics
Tight Chromatic Number for a class of Graphs with two forbidden subgraphs
Medha Dhurandhar
2016-05-11
Data Structures and Algorithms · Computer Science
Subcoloring of (Unit) Disk Graphs
Malory Marin, Rémi Watrigant
2025-06-25
Combinatorics · Mathematics
On chromatic numbers of some distance graphs
D. Zakharov
2016-08-08
Combinatorics · Mathematics
An improved procedure for colouring graphs of bounded local density
Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang
2022-09-13
Combinatorics · Mathematics
Upper bounds for the list-distinguishing chromatic number
Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh
2025-07-23
Combinatorics · Mathematics
The colouring number of infinite graphs
Nathan Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher
2018-07-05