"2-subcoloring is NP-complete for planar comparability graphs."

Pascal Ochem (2017)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics