2-subcoloring is NP-complete for planar comparability graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Journal Articles Information Processing Letters Year : 2017

2-subcoloring is NP-complete for planar comparability graphs

Pascal Ochem
Algorithmes, Graphes et Combinatoire
CV

Domains

Discrete Mathematics [cs.DM]

Isabelle Gouat  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01692394

Submitted on : Thursday, January 25, 2018-10:03:25 AM

Last modification on : Saturday, July 15, 2023-4:10:00 AM

Consult the full text

Dates and versions

lirmm-01692394 , version 1 (25-01-2018)

Identifiers

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER
154 View
0 Download

Altmetric

Share

More