
Biclique Graphs of K_3free Graphs and Bipartite Graphs
A biclique of a graph is a maximal complete bipartite subgraph. The bicl...
read it

An Algorithm for Generating Strongly Chordal Graphs
Strongly chordal graphs are a subclass of chordal graphs. The interest i...
read it

Integer programs with bounded subdeterminants and two nonzeros per row
We give a strongly polynomialtime algorithm for integer linear programs...
read it

Strongly Connected Components in Stream Graphs: Computation and Experimentations
Stream graphs model highly dynamic networks in which nodes and/or links ...
read it

On classes of graphs with strongly sublinear separators
For real numbers c,epsilon>0, let G_c,epsilon denote the class of graphs...
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

On the structure of matrices avoiding intervalminor patterns
We study the structure of 01matrices avoiding a pattern P as an interva...
read it
Strongly chordal digraphs and Γfree matrices
We define strongly chordal digraphs, which generalize strongly chordal graphs and chordal bipartite graphs, and are included in the class of chordal digraphs. They correspond to square 0,1 matrices that admit a simultaneous row and column permutation avoiding the Γ matrix. In general, it is not clear if these digraphs can be recognized in polynomial time, and we focus on symmetric digraphs (i.e., graphs with possible loops), tournaments with possible loops, and balanced digraphs. In each of these cases we give a polynomialtime recognition algorithm and a forbidden induced subgraph characterization.
READ FULL TEXT
Comments
There are no comments yet.