
Characterization by forbidden induced subgraphs of some subclasses of chordal graphs
Chordal graphs are the graphs in which every cycle of length at least fo...
read it

Structural characterization of some problems on circle and interval graphs
A graph is circle if there is a family of chords in a circle such that t...
read it

Wellpartitioned chordal graphs: obstruction set and disjoint paths
We introduce a new subclass of chordal graphs that generalizes split gra...
read it

Daisy cubes: a characterization and a generalization
Daisy cubes are a recently introduced class of isometric subgraphs of hy...
read it

Cops and Robbers on Graphs with a Set of Forbidden Induced Subgraphs
It is known that the class of all graphs not containing a graph H as an ...
read it

On density of subgraphs of halved cubes
Let S be a family of subsets of a set X of cardinality m and VCdim( S)...
read it

Minimal obstructions to (s,1)polarity in cographs
Let k,l be nonnegative integers. A graph G is (k,l)polar if its vertex ...
read it
Forbidden induced subgraph characterization of circle graphs within split graphs
A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there are diverse characterizations of circle graphs, a structural characterization by minimal forbidden induced subgraphs for the entire class of circle graphs is not known, not even restricted to split graphs (which are the graphs whose vertex set can be partitioned into a clique and a stable set). In this work, we give a characterization by minimal forbidden induced subgraphs of circle graphs, restricted to split graphs.
READ FULL TEXT
Comments
There are no comments yet.