Doubly lexical orderings of matrices
SIAM Journal on Computing
Discrete Mathematics
Grid intersection graphs and boxicity
Discrete Mathematics - Special issue on combinatorics and algorithms
A special planar satisfiability problem and a consequence of its NP-completeness
Discrete Applied Mathematics
Permuting matrices to avoid forbidden submatrices
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Recognizing interval digraphs and interval bigraphs in polynomial time
Discrete Applied Mathematics
Short proofs for interval digraphs
Discrete Mathematics
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Discrete Mathematics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics
Interval bigraphs and circular arc graphs
Journal of Graph Theory
Simple geometrical intersection graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Discrete Applied Mathematics
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Hi-index | 0.04 |
We show that the class of unit grid intersection graphs properly includes both of the classes of interval bigraphs and of P"6-free chordal bipartite graphs. We also demonstrate that the classes of unit grid intersection graphs and of chordal bipartite graphs are incomparable.