Articles
A note on construction of upper bound graphs

https://doi.org/10.1016/S1571-0653(04)00072-1Get rights and content

Abstract

In this paper, we consider construction of upper bound graphs. An upper bound graph can be transformed into a nova by contractions and a nova can be transformed into an upper bound graph by splits. These results include a characterization on upper bound graphs.

References (9)

  • K. Ogawa

    Note on radius of posets whose upper bound graphs are the same

    Proceedings of the School of Sciences, Tokai University

    (1999)
  • D.J. Bergstrand et al.

    On upper bound graphs of partially ordered sets

    Congressus Numerantium

    (1988)
  • D. Diny

    The double bound graph of a partially ordered set

    Journal of Combinatorics, Information & System Sciences

    (1985)
  • H. Era, K. Ogawa and M. Tsuchiya, On transformations of posets which have the same bound graph,...
There are more references available in the full text version of this article.

Cited by (0)

View full text