DeepAI AI Chat
Log In Sign Up

On the Clique-Width of Unigraphs

by   Yu Nakahata, et al.
Kyoto University

Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates many studies to investigate whether the clique-width of graphs in a certain class is bounded or not. We focus on unigraphs, that is, graphs uniquely determined by their degree sequences up to isomorphism. We show that every unigraph has clique-width at most 5. It follows that many problems that are NP-hard in general are polynomial-time solvable for unigraphs.


page 1

page 2

page 3

page 4


Clique-Width: Harnessing the Power of Atoms

Many NP-complete graph problems are polynomially solvable on graph class...

Locally checkable problems parameterized by clique-width

We continue the study initiated by Bonomo-Braberman and Gonzalez in 2020...

Clique-Width of Point Configurations

While structural width parameters (of the input) belong to the standard ...

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width

In this paper, we provide polynomial-time algorithms for different exten...

On the Parameterized Complexity of Relaxations of Clique

We investigate the parameterized complexity of several problems formaliz...

Clique-Width for Hereditary Graph Classes

Clique-width is a well-studied graph parameter owing to its use in under...

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

Parameterized complexity theory has enabled a refined classification of ...