On the complexity of colouring antiprismatic graphs

Autor: Nicolas Trotignon, Cléophée Robin, Myriam Preissmann

Publikováno v: Algorithmica
Algorithmica, 2020, 83 (2), pp.589-612. ⟨10.1007/s00453-020-00767-7⟩
Algorithmica, Springer Verlag, 2020, 83 (2), pp.589-612. ⟨10.1007/s00453-020-00767-7⟩

International audience; A graph G is prismatic if for every triangle T of G, every vertex of G not in T has a unique neighbour in T. The complement of a prismatic graph is called \emph{antiprismatic}. The complexity of colouring antiprismatic graphs

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5e9434a77c0c901bc8e882cb0fa454e
https://hal.science/hal-02392476