• Corpus ID: 219177006

Structural characterization of some problems on circle and interval graphs

  title={Structural characterization of some problems on circle and interval graphs},
  author={Nina Pardal},
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… 
2-nested Matrices: towards Understanding the Structure of Circle Graphs
2-nested matrices are defined and characterised, which are (0, 1)matrices with a variant of the C1P and for which there is also certain assignment of one of two colors to each block of consecutive 1’s in each row.


Some new results on circle graphs
Abstract: The intersection graph of a set of chords on a circle is called a circle graph. This class of graphs admits some interesting subclasses, such as: Helly circle graphs, clique-Helly circle
Circle Graph Obstructions
A local complementation of a simple graph G at one of its vertices v is the operation which replaces the subgraph of G induced by the neighborhood of v by its complement.
Permutation Graphs and Transitive Graphs
Algorithms for finding a maximum size clique and a minimum coloration of transitive grapl are presented and are applicable in solving problems in memo] allocation and circuit layout.
Circle graph obstructions under pivoting
The pivot-minor-minimal non-circle-graphs are determined, by computer search, as a corollary to Bouchet's characterization of circle graphs under local complementation, which generalizes Kuratowski’s Theorem.
Separability Generalizes Dirac's Theorem
Decomposition of Directed Graphs
A composition for directed graphs which generalizes the substitution (or X-join) composition of graphs and digraphs, as well as the graph version of set-family composition, is described. It is proved
NP-completeness results for edge modification problems