Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorimasa Tsuchiya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j24]Shin-Ichiro Tashiro, Kenjiro Ogawa, Morimasa Tsuchiya:
Posets with series parallel orders and strict-double-bound graphs. Bull. ICA 91: 128-137 (2021)- [j23]Kazutaka Ikeda, Kenjiro Ogawa, Satoshi Tagusari, Shin-Ichiro Tashiro, Morimasa Tsuchiya:
On strict-double-bound numbers of graphs and cut sets. Electron. J. Graph Theory Appl. 9(2): 443-450 (2021)
2010 – 2019
- 2018
- [j22]Gen Kawatani, Kenjiro Ogawa, Morimasa Tsuchiya:
2-upper bound graphs of posets. Ars Comb. 140: 173-182 (2018) - [j21]Kyohei Nakada, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
Note on p-competition graphs of spiders. Discret. Math. Algorithms Appl. 10(6): 1850084:1-1850084:7 (2018) - 2015
- [j20]Kenjiro Ogawa, Yuhei Shiraki, Satoshi Tagusari, Morimasa Tsuchiya:
On strict-double-bound numbers of caterpillars. Discret. Math. Algorithms Appl. 7(3): 1550038:1-1550038:7 (2015) - 2013
- [j19]Syota Konishi, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
On strict-double-bound numbers of spiders and ladders. Ars Comb. 108: 249-255 (2013) - 2012
- [j18]Kenjiro Ogawa, Ryoko Soejima, Satoshi Tagusari, Morimasa Tsuchiya:
Note on strict-double-bound numbers of nearly complete graphs missing some edges. Discret. Math. 312(3): 584-587 (2012) - 2010
- [j17]Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
On distance two graphs of upper bound graphs. Discret. Math. 310(22): 3276-3277 (2010)
2000 – 2009
- 2009
- [j16]Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
Note on upper bound graphs and forbidden subposets. Discret. Math. 309(11): 3659-3663 (2009) - [j15]Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
On double bound graphs and forbidden subposets. Discret. Math. 309(22): 6353-6358 (2009) - 2008
- [j14]Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
A note on chordal bound graphs and posets. Discret. Math. 308(5-6): 955-961 (2008) - 2006
- [j13]Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
On double bound graphs and forbidden subposets. Electron. Notes Discret. Math. 24: 267-271 (2006) - 2005
- [j12]Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya:
Note on transformation of posets with the same semi bound graphs. Ars Comb. 76 (2005) - [j11]Hiroshi Era, Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
On upper bound graphs with forbidden subposets. Electron. Notes Discret. Math. 22: 107-111 (2005) - 2002
- [j10]Hiroshi Era, Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
A note on construction of upper bound graphs. Electron. Notes Discret. Math. 11: 284-291 (2002) - 2001
- [j9]Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya:
On transformations of posets which have the same bound graph. Discret. Math. 235(1-3): 215-220 (2001) - 2000
- [j8]Morimasa Tsuchiya, Kenjiro Ogawa, Shin-ichi Iwai:
On construction of bound graphs. Electron. Notes Discret. Math. 5: 299-302 (2000) - [j7]Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya:
On upper bound graphs with respect to operations on graphs. Theor. Comput. Sci. 235(2): 219-223 (2000) - [c1]Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
On Double Bound Graphs with Respect to Graph Operations. JCDCG 2000: 167-175
1990 – 1999
- 1998
- [j6]Morimasa Tsuchiya:
On uniform intersection numbers. Ars Comb. 48 (1998) - [j5]Hiroshi Era, Morimasa Tsuchiya:
On upper bound graphs whose complements are also upper bound graphs. Discret. Math. 179(1-3): 103-109 (1998) - 1994
- [j4]Morimasa Tsuchiya:
On antichain intersection numbers, total clique covers and regular graphs. Discret. Math. 127(1-3): 305-318 (1994) - 1992
- [j3]Morimasa Tsuchiya:
On shifted intersecting families with respect to posets. Australas. J Comb. 5: 53-58 (1992)
1980 – 1989
- 1988
- [j2]Takayuki Hibi, Hiroshi Narushima, Morimasa Tsuchiya, Kei-ichi Watanabe:
A graph-theoretical characterization of the order complexes on the 2-sphere. Discret. Math. 72(1-3): 167-174 (1988) - 1985
- [j1]Morimasa Tsuchiya:
On determination of graph G whose bond lattice L(G) is modular. Discret. Math. 56(1): 79-81 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2022-11-16 23:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
