
Forbidden induced subgraph characterization of circle graphs within split graphs
A graph is circle if its vertices are in correspondence with a family of...
read it

2nested matrices: towards understanding the structure of circle graphs
A (0,1)matrix has the consecutiveones property (C1P) if its columns ca...
read it

𝒮adic characterization of minimal ternary dendric subshifts
Dendric subshifts are defined by combinatorial restrictions of the exten...
read it

Circularly compatible ones, Dcircularity, and proper circulararc bigraphs
In 1969, Alan Tucker characterized proper circulararc graphs as those g...
read it

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

On nested and 2nested graphs: two subclasses of graphs between threshold and split graphs
A (0,1)matrix has the Consecutive Ones Property (C1P) for the rows if t...
read it

GraphInduced Rank Structures and their Representations
A new framework is proposed to study rankstructured matrices arising fr...
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 two vertices are adjacent if the corresponding chords cross each other. There are diverse characterizations of circle graphs, many of them using the notions of local complementation or split decomposition. However, there are no known structural characterization by minimal forbidden induced subgraphs for circle graphs. In this thesis, we give a characterization by forbidden induced subgraphs of circle graphs within split graphs. A (0,1)matrix has the consecutiveones property (C1P) for the rows if there is a permutation of its columns such that the 1's in each row appear consecutively. In this thesis, we develop characterizations by forbidden subconfigurations of (0,1)matrices with the C1P for which the rows are 2colorable under a certain adjacency relationship, and we characterize structurally some auxiliary circle graph subclasses that arise from these special matrices. Given a graph class Π, a Πcompletion of a graph G = (V,E) is a graph H = (V, E ∪ F) such that H belongs to Π. A Πcompletion H of G is minimal if H'= (V, E ∪ F') does not belong to Π for every proper subset F' of F. A Πcompletion H of G is minimum if for every Πcompletion H' = (V, E ∪ F') of G, the cardinal of F is less than or equal to the cardinal of F'. In this thesis, we study the problem of completing minimally to obtain a proper interval graph when the input is an interval graph. We find necessary conditions that characterize a minimal completion in this particular case, and we leave some conjectures for the future.
READ FULL TEXT
Comments
There are no comments yet.