A connected graph G is a well-partitioned chordal graph if there exist a partition P of the vertex set of G into cliques and a tree T having P as a vertex set ...

Feb 25, 2020 · We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs.

May 4, 2021 · Well-partitioned chordal graphs are graphs whose vertex set can be partitioned into cliques that can be arranged in a tree structure, without ...

May 19, 2022 · We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs.

Oct 1, 2022 · We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs.

Feb 25, 2020 · Abstract. We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs.

A graph G=(V,E) is a well-partitioned chordal graph if a partition P of V and a tree (P,T) exist such that. every partite set X∈P induces a clique in G ...

We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs.

Oct 9, 2020 · We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs.

We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs.