2-subcoloring is NP-complete for planar comparability graphs

Pascal Ochem 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01692394
Contributor : Isabelle Gouat <>
Submitted on : Thursday, January 25, 2018 - 10:03:25 AM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM

Links full text

Identifiers

Collections

Citation

Pascal Ochem. 2-subcoloring is NP-complete for planar comparability graphs. Information Processing Letters, Elsevier, 2017, 128, pp.46-48. ⟨10.1016/j.ipl.2017.08.004⟩. ⟨lirmm-01692394⟩

Share

Metrics

Record views

202