Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Konrad K. Dabrowski 1 François Dross 2 Matthew Johnson 1 Daniël Paulusma 1
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481412
Contributor : François Dross <>
Submitted on : Thursday, March 2, 2017 - 3:38:15 PM
Last modification on : Thursday, July 19, 2018 - 4:58:09 PM

Links full text

Identifiers

Collections

Citation

Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA: International Workshop on Combinatorial Algorithms, 2015, Verona, Italy. pp.100-111, ⟨10.1007/978-3-319-29516-9_9⟩. ⟨lirmm-01481412⟩

Share

Metrics

Record views

240