Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges

@article{Das2005BigraphsdigraphsOF,
  title={Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges},
  author={Ashok Kr. Das and Malay Kr. Sen},
  journal={Discrete Mathematics},
  year={2005},
  volume={295},
  pages={191-195}
}
Three mutually separable edges of a graph form an asteroidal triple of edges (ATE), if for any two of them, there is a path from the vertex set of one to the vertex set of another that avoids the neighbours of the third edge. In this note, it is shown that a bigraph of Ferrers dimension at most 2 is bichordal and ATE-free, but the converse is not true. © 2005 Elsevier B.V. All rights reserved. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

The recognition of indifference digraphs and generalized semiorder

  • G. Steiner
  • J. Graph Theory 21
  • 1996
1 Excerpt

Representing digraphs using intervals and circular arcs

  • B. K. Sanyal, D. B. West
  • Discrete Math .
  • 1989

On realizable biorders and the biorder dimension of a relation

  • J. P. Doignon, A. Ducamp, J. E. Falmagne
  • J. Math. Psych. 28
  • 1984
1 Excerpt

Bipartite intersection graphs

  • F. Harrary, J. A. Kabel, F. R. McMorris
  • Comm. Math. Univ. Corolina 23
  • 1982
1 Excerpt

Boland , Representation of finite graph by a set of intervals on the real line , Fund

  • J. Ch. C. J. Lekkerkerker
  • Math .
  • 1982

characterization of bigraphs with Ferrers dimension 2, Rap

  • A O. Cogis
  • Rech. 19, G.R. CNRS,
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…