Search the dblp DataBase
Morimasa Tsuchiya :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Shin-ichi Iwai , Kenjiro Ogawa , Morimasa Tsuchiya On Double Bound Graphs with Respect to Graph Operations. [Citation Graph (0, 0)][DBLP ] JCDCG, 2000, pp:167-175 [Conf ] Hiroshi Era , Kenjiro Ogawa , Morimasa Tsuchiya Note on transformation of posets with the same semi bound graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2005, v:76, n:, pp:- [Journal ] Morimasa Tsuchiya On uniform intersection numbers. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:48, n:, pp:- [Journal ] Hiroshi Era , Kenjiro Ogawa , Morimasa Tsuchiya On transformations of posets which have the same bound graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:235, n:1-3, pp:215-220 [Journal ] Hiroshi Era , Kenjiro Ogawa , Morimasa Tsuchiya On upper bound graphs with respect to operations on graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:235, n:2, pp:219-223 [Journal ] Morimasa Tsuchiya On determination of graph G whose bond lattice L(G) is modular. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1985, v:56, n:1, pp:79-81 [Journal ] Takayuki Hibi , Hiroshi Narushima , Morimasa Tsuchiya , Kei-ichi Watanabe A graph-theoretical characterization of the order complexes on the 2-sphere. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1988, v:72, n:1-3, pp:167-174 [Journal ] Hiroshi Era , Morimasa Tsuchiya On upper bound graphs whose complements are also upper bound graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:179, n:1-3, pp:103-109 [Journal ] Morimasa Tsuchiya On antichain intersection numbers, total clique covers and regular graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:127, n:1-3, pp:305-318 [Journal ] A note on chordal bound graphs and posets. [Citation Graph (, )][DBLP ] Note on upper bound graphs and forbidden subposets. [Citation Graph (, )][DBLP ] On double bound graphs and forbidden subposets. [Citation Graph (, )][DBLP ] On distance two graphs of upper bound graphs. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs