2-subcoloring is NP-complete for planar comparability graphs

Journal article

Peer reviewed

Information Processing Letters, Vol.128, pp.46-48

12/2017

Abstract

Computational complexity

NP-completeness

Graph coloring

url

Find in HALView

1 Record Views

Title: 2-subcoloring is NP-complete for planar comparability graphs
Creators - without role: Pascal Ochem - Centre National de la Recherche Scientifique
Publication Details: Information Processing Letters, Vol.128, pp.46-48
Identifiers: 9944411309311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-01692394