Near-colorings: non-colorable graphs and NP-completeness

Mickaël Montassier 1 Pascal Ochem 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : http://www.combinatorics.org/ojs/index.php/eljc/article/download/v22i1p57/pdf
Document type :
Journal articles
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01263770
Contributor : Pascal Ochem <>
Submitted on : Saturday, March 25, 2017 - 7:08:08 PM
Last modification on : Wednesday, October 17, 2018 - 5:08:02 PM
Long-term archiving on : Monday, June 26, 2017 - 12:57:08 PM

File

3509-13132-2-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-01263770, version 1
  • ARXIV : 1306.0752v2

Collections

Citation

Mickaël Montassier, Pascal Ochem. Near-colorings: non-colorable graphs and NP-completeness. The Electronic Journal of Combinatorics, Open Journal Systems, 2015, 22 (1), pp.#P1.57. ⟨lirmm-01263770⟩

Share

Metrics

Record views

133

Files downloads

253