A Characterization of Semi Bound Graphs
Bulletin of the Malaysian Mathematical Society, Tome 27 (2004) no. 1
Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website
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.
Classification :
05C62
@article{BMMS_2004_27_1_a3,
author = {Hiroshi Era and Kenjiro Ogawa and Morimasa Tsuchiya},
title = {A {Characterization} of {Semi} {Bound} {Graphs}},
journal = {Bulletin of the Malaysian Mathematical Society},
year = {2004},
volume = {27},
number = {1},
url = {http://geodesic.mathdoc.fr/item/BMMS_2004_27_1_a3/}
}
Hiroshi Era; Kenjiro Ogawa; Morimasa Tsuchiya. A Characterization of Semi Bound Graphs. Bulletin of the Malaysian Mathematical Society, Tome 27 (2004) no. 1. http://geodesic.mathdoc.fr/item/BMMS_2004_27_1_a3/