Representation characterizations of chordal bipartite graphs

A bipartite graph is chordal bipartite if it does not contain an induced cycle of length at least six. We give three representation characterizations of chordal bipartite graphs. More precisely, we show that a bipartite graph is chordal bipartite if and only if the complement is the intersection graph of a family of pairwise compatible claws in a weighted hypercircle. (A hypercircle is a graph which consists of internally vertex disjoint paths between two distinguished vertices, and a claw in a hypercircle is a connected subgraph containing exactly one of the two distinguished vertices.) We also introduce two classes of bipartite graphs, both containing interval bigraphs and interval containment bigraphs. They are compatible subtree intersection bigraphs and compatible subtree containment bigraphs. We show that these two classes are identical to the class of chordal bipartite graphs.

[1]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[2]  Jeremy P. Spinrad.  Circular-arc graphs with clique cover number two , 1988, J. Comb. Theory, Ser. B.

[3]  Alan Tucker,et al.  Characterizing circular-arc graphs , 1970 .

[4]  G. Dirac.  On rigid circuit graphs , 1961 .

[5]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[6]  William T. Trotter,et al.  Characterization problems for graphs, partially ordered sets, lattices, and families of sets , 1976, Discret. Math..

[7]  Douglas B. West,et al.  Interval digraphs: An analogue of interval graphs , 1989, J. Graph Theory.

[8]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[9]  Douglas B. West,et al.  Representing digraphs using intervals or circular arcs , 1995, Discret. Math..

[10]  L. Guttman.  A basis for scaling qualitative data. , 1944 .

[11]  Olivier Cogis,et al.  Ferrers digraphs and threshold graphs , 1982, Discret. Math..

[12]  Pavol Hell,et al.  Two remarks on circular arc graphs , 1997, Graphs Comb..

[13]  Martin Charles Golumbic,et al.  Perfect Elimination and Chordal Bipartite Graphs , 1978, J. Graph Theory.

[14]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[15]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[16]  Pavol Hell,et al.  List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[17]  P. Hell,et al.  Interval bigraphs and circular arc graphs , 2004 .

[18]  P. Hell,et al.  Sparse pseudo-random graphs are Hamiltonian , 2003 .

[19]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..