In this paper, we provide complete classification of classes of bipartite graphs defined by a single forbidden induced bipartite subgraph with respect to bounded/unbounded clique-width
We prove that the tree-width of graphs in a hereditary class defined by a finite set of forbidden i...
We prove that the tree-width of graphs in a hereditary class defined by a finite set of forbidden i...
If a graph has no induced subgraph isomorphic to any graph in a finite family {H1,…,Hp}, it is said ...
International audienceWe consider hereditary classes of bipartite graphs where clique-width is bound...
In the present paper, we identify the first two minimal with respect to set-inclusion hereditary cla...
Let GG be a bipartite graph, and let HH be a bipartite graph with a fixed bipartition (BH,WH)(BH,WH)...
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...
We consider hereditary classes of bipartite graphs where clique-width is bounded, but linear clique-...
AbstractWe study the linear clique-width of graphs that are obtained from paths by disjoint union an...
We define permutation-partition graphs by replacing one part of a 2K2-free bipartite graph (a bipart...
The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary cla...
We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for whi...
Clique-width is an important graph parameter due to its algorithmic and structural properties. A gra...
AbstractA bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In...
We prove that the tree-width of graphs in a hereditary class defined by a finite set of forbidden i...
We prove that the tree-width of graphs in a hereditary class defined by a finite set of forbidden i...
If a graph has no induced subgraph isomorphic to any graph in a finite family {H1,…,Hp}, it is said ...
International audienceWe consider hereditary classes of bipartite graphs where clique-width is bound...
In the present paper, we identify the first two minimal with respect to set-inclusion hereditary cla...
Let GG be a bipartite graph, and let HH be a bipartite graph with a fixed bipartition (BH,WH)(BH,WH)...
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...
We consider hereditary classes of bipartite graphs where clique-width is bounded, but linear clique-...
AbstractWe study the linear clique-width of graphs that are obtained from paths by disjoint union an...
We define permutation-partition graphs by replacing one part of a 2K2-free bipartite graph (a bipart...
The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary cla...
We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for whi...
Clique-width is an important graph parameter due to its algorithmic and structural properties. A gra...
AbstractA bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In...
We prove that the tree-width of graphs in a hereditary class defined by a finite set of forbidden i...
We prove that the tree-width of graphs in a hereditary class defined by a finite set of forbidden i...
If a graph has no induced subgraph isomorphic to any graph in a finite family {H1,…,Hp}, it is said ...
DOI
Add to ORKG