Representing digraphs using intervals or circular arcs
Discrete Mathematics
Recognizing interval digraphs and interval bigraphs in polynomial time
Discrete Applied Mathematics
Short proofs for interval digraphs
Discrete Mathematics
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
A polynomial time recognition algorithm for probe interval graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Construction of probe interval models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Discrete Applied Mathematics
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
SIAM Journal on Discrete Mathematics
Interval bigraphs and circular arc graphs
Journal of Graph Theory
On the recognition of probe graphs of some self-complementary classes of perfect graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Hi-index | 0.04 |
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bigraph from its adjacency matrix. Finally, we note that if we add a loop at every probe vertex of a probe interval graph, then the Ferrers dimension of the corresponding symmetric bipartite graph is at most 3.