May 31, 2016 · We describe the clique-width of path powers by an exact formula, depending only on the number of vertices and the clique number.
Abstract. We describe the clique-width of path powers by an exact formula, depending only on the number of vertices and the clique number.
In graph theory, the clique-width of a graph G is a parameter that describes the structural complexity of the graph.
People also ask
What is clique-width?
What is the size of the clique in graph theory?
What is the distance to clique parameter?
What is a 3 clique graph?
Our characterisation results in a simple linear-time algorithm for computing the linear clique-width of all path powers. This work is supported by the Research ...
Abstract. Clique-width is one of the most important graph parameters, as many NP-hard graph problems are solvable in linear time on graphs of bounded ...
May 31, 2016 · We describe the clique-width of path powers by an exact formula, depending only on the number of vertices and the clique number.
Abstract. A k-path power is the k-power graph of a simple path of arbitrary length. Path powers form a non-trivial subclass of proper interval graphs.
We describe the clique-width of path powers by an exact formula, depending only on the number of vertices and the clique number.
This paper presents a new characterisation of clique-width based on rooted binary trees, completely without the use of labelled graphs, and a result that ...
Clique-width is one of the most important graph parameters, as many NP-hard graph problems are solvable in linear time on graphs of bounded clique-width.