Graph colouring variations

Author(s):  
Alain Hertz ◽  
Bernard Ries
Keyword(s):  
2020 ◽  
Vol 16 (1) ◽  
pp. 1
Author(s):  
Anderson Faustino Da Silva ◽  
Luis Gustavo Araujo Rodriguez ◽  
N.A. Jo�ã ◽  
o Fabrício Filho

Author(s):  
Jorge Flores Cruz ◽  
Pedro Lara Velázquez ◽  
Miguel A. Gutiérrez Andrade ◽  
Sergio Gerardo De los Cobos Silva ◽  
Eric Alfredo Rincón García ◽  
...  

2020 ◽  
Author(s):  
C. A. Weffort-Santos ◽  
L. L. C. Pedrosa

We study a generalization of graph colouring define as follows. Given a graph G, a (star, k)-colouring of G is a colouring c : V(G) → {1, ..., k} such that every colour class induces a star. We propose an O*(2^(O(tw))k^(tw)-time algorithm that decides whether a graph G of treewidth at most tw admits a (star, k)-colouring. This resolves an open problem posed by Angelini et al. in 2017. Our approach can be extended to other defective colouring models.


2000 ◽  
Vol 76 (1-2) ◽  
pp. 91-94 ◽  
Author(s):  
Stefan Dobrev ◽  
Heiko Schröder ◽  
Ondrej Sýkora ◽  
Imrich Vrt'o
Keyword(s):  

2008 ◽  
Vol 107 (2) ◽  
pp. 60-63 ◽  
Author(s):  
K.R. Duffy ◽  
N. O'Connell ◽  
A. Sapozhnikov

2012 ◽  
Vol 39 (9) ◽  
pp. 1933-1950 ◽  
Author(s):  
R. Lewis ◽  
J. Thompson ◽  
C. Mumford ◽  
J. Gillard

Sign in / Sign up

Export Citation Format

Share Document