DeepAI AI Chat
Log In Sign Up

Deciding twin-width at most 4 is NP-complete

by   Pierre Bergé, et al.

We show that determining if an n-vertex graph has twin-width at most 4 is NP-complete, and requires time 2^Ω(n/log n) unless the Exponential-Time Hypothesis fails. Along the way, we give an elementary proof that n-vertex graphs subdivided at least 2 log n times have twin-width at most 4. We also show how to encode trigraphs H (2-edge colored graphs involved in the definition of twin-width) into graphs G, in the sense that every d-sequence (sequence of vertex contractions witnessing that the twin-width is at most d) of G inevitably creates H as an induced subtrigraph, whereas there exists a partial d-sequence that actually goes from G to H. We believe that these facts and their proofs can be of independent interest.


page 1

page 3

page 5

page 19

page 25

page 26

page 27

page 29


Bounds for the Twin-width of Graphs

Bonnet, Kim, Thomassé, and Watrigant (2020) introduced the twin-width of...

On Efficient Domination for Some Classes of H-Free Bipartite Graphs

A vertex set D in a finite undirected graph G is an efficient dominatin...

Checking the admissibility of odd-vertex pairings is hard

Nash-Williams proved that every graph has a well-balanced orientation. A...

Convex Hulls and Simple Colourings in Directed and 2-edge-Coloured Graphs

An oriented graph (2-edge-coloured graph) is complete convex when the co...

On the complexity of finding large odd induced subgraphs and odd colorings

We study the complexity of the problems of finding, given a graph G, a l...

Deciding Morality of Graphs is NP-complete

In order to find a causal explanation for data presented in the form of ...

Making Life More Confusing for Firefighters

It is well known that fighting a fire is a hard task. The Firefighter pr...