Complexity-separating graph classes for vertex, edge and total colouring

Given a class A of graphs and a decision problem π belonging to NP, we say that a full complexity dichotomy of A was obtained if one describes a partition of A into subclasses such that π is classified as polynomial or NP-complete when restricted to each subclass. The concept of full complexity dich...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2020-07, Vol.281, p.162-171
1. Verfasser: de Figueiredo, Celina M.H.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Given a class A of graphs and a decision problem π belonging to NP, we say that a full complexity dichotomy of A was obtained if one describes a partition of A into subclasses such that π is classified as polynomial or NP-complete when restricted to each subclass. The concept of full complexity dichotomy is particularly interesting for the investigation of NP-complete problems: as we partition a class A into NP-complete subclasses and polynomial subclasses, it becomes clearer why the problem is NP-complete in A. The class C of graphs that do not contain a cycle with a unique chord was studied by Trotignon and Vušković who proved a structure theorem which led to solving the vertex-colouring problem in polynomial time. In the present survey, we apply the structure theorem to study the complexity of edge-colouring and total-colouring, and show that even for graph classes with strong structure and powerful decompositions, the edge-colouring problem may be difficult. We discuss several surprising complexity dichotomies found in subclasses of C, and the concepts of separating problem proposed by David S. Johnson and the dual concept of separating class.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2019.02.039