On determination of graph G whose bond lattice L(G) is modular. - Morimasa Tsuchiya (Discret. Math., 1985)

A graph-theoretical characterization of the order complexes on the 2-sphere. - Takayuki Hibi; Hiroshi Narushima; Morimasa Tsuchiya; Kei-ichi Watanabe (Discret. Math., 1988)

On shifted intersecting families with respect to posets. - Morimasa Tsuchiya (Australas. J Comb., 1992)

On antichain intersection numbers, total clique covers and regular graphs. - Morimasa Tsuchiya (Discret. Math., 1994)

On uniform intersection numbers. - Morimasa Tsuchiya (Ars Comb., 1998)

On upper bound graphs whose complements are also upper bound graphs. - Hiroshi Era; Morimasa Tsuchiya (Discret. Math., 1998)

On Double Bound Graphs with Respect to Graph Operations. - Shin-ichi Iwai; Kenjiro Ogawa; Morimasa Tsuchiya (JCDCG, 2000)

On construction of bound graphs. - Morimasa Tsuchiya; Kenjiro Ogawa; Shin-ichi Iwai (Electron. Notes Discret. Math., 2000)

On upper bound graphs with respect to operations on graphs. - Hiroshi Era; Kenjiro Ogawa; Morimasa Tsuchiya (Theor. Comput. Sci., 2000)

On transformations of posets which have the same bound graph. - Hiroshi Era; Kenjiro Ogawa; Morimasa Tsuchiya (Discret. Math., 2001)

A note on construction of upper bound graphs. - Hiroshi Era; Shin-ichi Iwai; Kenjiro Ogawa; Morimasa Tsuchiya (Electron. Notes Discret. Math., 2002)

Note on transformation of posets with the same semi bound graphs. - Hiroshi Era; Kenjiro Ogawa; Morimasa Tsuchiya (Ars Comb., 2005)

On upper bound graphs with forbidden subposets. - Hiroshi Era; Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya (Electron. Notes Discret. Math., 2005)

On double bound graphs and forbidden subposets. - Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya (Electron. Notes Discret. Math., 2006)

A note on chordal bound graphs and posets. - Shin-ichi Iwai; Kenjiro Ogawa; Morimasa Tsuchiya (Discret. Math., 2008)

Note on upper bound graphs and forbidden subposets. - Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya (Discret. Math., 2009)

On distance two graphs of upper bound graphs. - Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya (Discret. Math., 2010)

Note on strict-double-bound numbers of nearly complete graphs missing some edges. - Kenjiro Ogawa; Ryoko Soejima; Satoshi Tagusari; Morimasa Tsuchiya (Discret. Math., 2012)

On strict-double-bound numbers of spiders and ladders. - Syota Konishi; Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya (Ars Comb., 2013)

On strict-double-bound numbers of caterpillars. - Kenjiro Ogawa; Yuhei Shiraki; Satoshi Tagusari; Morimasa Tsuchiya (Discret. Math. Algorithms Appl., 2015)

2-upper bound graphs of posets. - Gen Kawatani; Kenjiro Ogawa; Morimasa Tsuchiya (Ars Comb., 2018)

Note on p-competition graphs of spiders. - Kyohei Nakada; Kenjiro Ogawa; Satoshi Tagusari; Morimasa Tsuchiya (Discret. Math. Algorithms Appl., 2018)

Posets with series parallel orders and strict-double-bound graphs. - Shin-Ichiro Tashiro; Kenjiro Ogawa; Morimasa Tsuchiya (Bull. ICA, 2021)

On strict-double-bound numbers of graphs and cut sets. - Kazutaka Ikeda; Kenjiro Ogawa; Satoshi Tagusari; Shin-Ichiro Tashiro; Morimasa Tsuchiya (Electron. J. Graph Theory Appl., 2021)

On strict-double-bound graphs and Cartesian products of paths and cycles. - Yoshimi Egawa; Kenjiro Ogawa; Kenta Ozeki; Satoshi Tagusari; Morimasa Tsuchiya (Discret. Math. Algorithms Appl., 2024)