We establish the set of minimal forbidden induced subgraphs for the class of graphs having linear rank-width at most 1. From these we derive both the vertex-minor and pivot-minor obstructions for the class
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
We establish the set of minimal forbidden induced subgraphs for the class of graphs having linear ra...
Abstract. We prove that a connected graph has linear rank-width 1 if and only if it is a distance-he...
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its ...
We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
AbstractWe study the linear clique-width of graphs that are obtained from paths by disjoint union an...
In the present work we search for the minimal forbidden minors (also called obstructions) for the cl...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
AbstractThe linear-width of a graph G is defined to be the smallest integer k such that the edges of...
The rank-width is a graph parameter related in terms of fixed functions to clique-width but more tra...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
We establish the set of minimal forbidden induced subgraphs for the class of graphs having linear ra...
Abstract. We prove that a connected graph has linear rank-width 1 if and only if it is a distance-he...
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its ...
We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor...
Tree-width and its linear variant path-width play a central role for the graph minor relation. In pa...
AbstractWe study the linear clique-width of graphs that are obtained from paths by disjoint union an...
In the present work we search for the minimal forbidden minors (also called obstructions) for the cl...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
AbstractThe linear-width of a graph G is defined to be the smallest integer k such that the edges of...
The rank-width is a graph parameter related in terms of fixed functions to clique-width but more tra...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
DOI
Add to ORKG