On double bound graphs and forbidden subposets

For a poset P=(X,≤_P), the double bound graph (DB-graph) of P is the graph DB(P)=(X,E_DB(P)), where xy∈E_DB(P) if and only if x≠y and there exist n,m∈X such that n≤_Px,y≤_Pm. We obtain that for a subposet Q of a poset P,Q is an (n, m)-subposet of P if and only if DB(Q) is an induced subgraph DB(P). Using this result, we show some characterizations of split double bound graphs, threshold double bound graphs and difference double bound graphs in terms of (n, m)-subposets and double canonical posets.