Recent developments on graphs of bounded clique-width
- Kamiński, Marcin
- Lozin, Vadim V.
- Milanič, Martin
DOIAbstract
Kamiński M, Lozin VV, Milanič M. Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 2009;157(12):2747-2761
Kamiński M, Lozin VV, Milanič M. Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 2009;157(12):2747-2761
AbstractClique-width is a relatively new parameterization of graphs, philosophically similar to tree...
AbstractHierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP comp...
We define a width parameter for hypergraphs, which we call the decomposition-width. We provide an ex...
Whether the clique-width of graphs in a certain class of graphs is bounded or not, is an important q...
AbstractWhether the clique-width of graphs in a certain class of graphs is bounded or not, is an imp...
AbstractWhether the clique-width of graphs in a certain class of graphs is bounded or not, is an imp...
International audienceClique-width is a relatively new parameterization of graphs, philosophically s...
AbstractClique-width is a relatively new parameterization of graphs, philosophically similar to tree...
AbstractWe show that a set of graphs has bounded tree-width or bounded path-width if and only if the...
Recently, several constructions of bipartite graphs of large clique-width have been discovered in th...
International audienceWe consider hereditary classes of bipartite graphs where clique-width is bound...
Recently, several constructions of bipartite graphs of large clique-width have been discovered in th...
AbstractA graph has linear clique-width at most k if it has a clique-width expression using at most ...
We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for whi...
We define permutation-partition graphs by replacing one part of a 2K2-free bipartite graph (a bipart...
AbstractClique-width is a relatively new parameterization of graphs, philosophically similar to tree...
AbstractHierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP comp...
We define a width parameter for hypergraphs, which we call the decomposition-width. We provide an ex...
Whether the clique-width of graphs in a certain class of graphs is bounded or not, is an important q...
AbstractWhether the clique-width of graphs in a certain class of graphs is bounded or not, is an imp...
AbstractWhether the clique-width of graphs in a certain class of graphs is bounded or not, is an imp...
International audienceClique-width is a relatively new parameterization of graphs, philosophically s...
AbstractClique-width is a relatively new parameterization of graphs, philosophically similar to tree...
AbstractWe show that a set of graphs has bounded tree-width or bounded path-width if and only if the...
Recently, several constructions of bipartite graphs of large clique-width have been discovered in th...
International audienceWe consider hereditary classes of bipartite graphs where clique-width is bound...
Recently, several constructions of bipartite graphs of large clique-width have been discovered in th...
AbstractA graph has linear clique-width at most k if it has a clique-width expression using at most ...
We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for whi...
We define permutation-partition graphs by replacing one part of a 2K2-free bipartite graph (a bipart...
AbstractClique-width is a relatively new parameterization of graphs, philosophically similar to tree...
AbstractHierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP comp...
We define a width parameter for hypergraphs, which we call the decomposition-width. We provide an ex...
Add to ORKG