Volume 27 • Number 1 • 2004
 
• A Characterization of Semi Bound Graphs
Hiroshi Era, Kenjiro Ogawa and Morimasa Tsuchiya
Abstract. In this paper we deal with semi bound graphs. For a poset P, a graph G is a semi bound graph of P if V(G) = V(P) and
uv E(G) if and only if there exists a common upper bound of u and v or a common lower bound of u and v in P. We also obtain
characterizations of triangle-free semi bound graphs and semi bound graphs.
 
2000 Mathematics Subject Classification: 05C62

Full text: PDF