| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648591 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
In the upper bound graph of a poset PP, the vertex set is V(P)V(P) and xyxy is an edge if there exists an m∈V(P)m∈V(P) with x,y≤Pmx,y≤Pm. We show some characterizations on split upper bound graphs, threshold upper bound graphs and difference upper bound graphs in terms of mm-subposets and canonical posets.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya,