AbstractWe define a new form of graph decomposition, based on forbidding a fixed bipartite graph from occurring as an induced subgraph of edges which cross a partition of the vertices. We show that the generalized join decomposition proposed by Hsu (J. Combin. Theory Ser. B 43 (1987) 70) is NP-complete, while some other decompositions which can be described in this way can be found in polynomial time
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
AbstractThe H-decomposition problem for a fixed graph H is stated as follows: Can an input graph G b...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
AbstractWe define a new form of graph decomposition, based on forbidding a fixed bipartite graph fro...
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorph...
AbstractA 2-join is an edge cutset that naturally appears in decomposition of several classes of gra...
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorph...
This master’s thesis in graph theory focuses on graph decomposition. In practice, various forms of g...
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs clos...
AbstractA graph containment problem is to decide whether one graph can be modified into some other g...
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorph...
We study the problem of decomposing the vertex set V of a graphinto two parts (V1, V2) which induce ...
AbstractIn this paper, we revisit the split decomposition of graphs and give new combinatorial and a...
AbstractFor a family G of stars, a G-decomposition of a graph H is a partition of the edge set of H ...
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
AbstractThe H-decomposition problem for a fixed graph H is stated as follows: Can an input graph G b...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
AbstractWe define a new form of graph decomposition, based on forbidding a fixed bipartite graph fro...
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorph...
AbstractA 2-join is an edge cutset that naturally appears in decomposition of several classes of gra...
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorph...
This master’s thesis in graph theory focuses on graph decomposition. In practice, various forms of g...
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs clos...
AbstractA graph containment problem is to decide whether one graph can be modified into some other g...
For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorph...
We study the problem of decomposing the vertex set V of a graphinto two parts (V1, V2) which induce ...
AbstractIn this paper, we revisit the split decomposition of graphs and give new combinatorial and a...
AbstractFor a family G of stars, a G-decomposition of a graph H is a partition of the edge set of H ...
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
THE SPECIAL CHARACTERS IN THIS ABSTRACT CANNOT BE DISPLAYED CORRECTLY ON THIS PAGE. PLEASE REFER TO ...
AbstractThe H-decomposition problem for a fixed graph H is stated as follows: Can an input graph G b...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
DOI
Add to ORKG