In this paper, we define a graph G as semi-P4-sparse if G does not contain as induced subgraph a P5, a P 5 or the complement of a fork, where a fork is the ...
On semi-P4-sparse graphs · J. Fouquet, V. Giakoumakis · Published in Discrete Mathematics 15 March 1997 · Mathematics.
In Section 6, we propose a characterization by forbidden configurations of the closure under substitution-composition of the family of semi-PJsparse graphs.
In this paper, we define a graph G as semi-Pd-sparse if G does not contain as induced subgraph a PC, a 5 or the complement of a ,fork, where a fork is the ...
In the present paper, we identify the first two minimal with respect to set-inclusion hereditary classes of graphs of unbounded clique-width: Bipartite ...
Definition: A graph is P4-sparse if every set of five vertices contains at most one induced P4 .
In this paper, we define a graph G as semi- P 4 -sparse if G does not contain as induced subgraph a P 5 , a P 5 or the complement of a fork , where a fork ...
Hoàng defined the P4-sparse graphs as the graphs where every set of five vertices induces at most one P4. These graphs attracted considerable attention in ...
People also ask
What is considered a sparse graph?
What is minimum spanning tree in sparse graph?
What is a dense graph in data structure?
semi-P4-sparse. [402]. J.L. Fouquet, V. Giakoumakis On semi--P4--sparse graphs. Discrete Math. 165/166 1997 277--300. (known proper). Maximal subclasses. [+] ...
Due to their simple structure described in Theorem 2, semi-P 4 -sparse graphs have bounded clique width. See [10] for a complete classiÿcation of the clique ...