Title of article
On upper bound graphs with forbidden subposets
Author/Authors
Era، نويسنده , , Hiroshi and Ogawa، نويسنده , , Kenjiro and Tagusari، نويسنده , , Satoshi and Tsuchiya، نويسنده , , Morimasa، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
107
To page
111
Abstract
For a poset P = ( X , ⩽ P ) , the upper bound graph (UB-graph) of P is the graph U B ( P ) = ( X , E U B ( P ) ) , where x y ∈ E U B ( P ) if and only if x ≠ y and there exists m ∈ X such that x , y ⩽ P m . We show some characterizations on split upper bound graphs, threshold upper bound graphs and difference upper bound graphs in terms of m-subposets and canonical posets.
Keywords
upper bound graph , forbidden subgraph , forbidden subposet
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454100
Link To Document