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

2-subcoloring is NP-complete for planar comparability graphs

Pascal Ochem

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⟩
147 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More