default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShoichi Tsuchiya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Michitaka Furuya, Shoichi Tsuchiya:
Forbidden Subgraphs Restricting Vertices of Degree Two in a Spanning Tree. Electron. J. Comb. 31(3) (2024)- 2023
- [j20]Songling Shan
, Shoichi Tsuchiya:
Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree. J. Graph Theory 104(4): 886-903 (2023) - 2022
- [j19]Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima:
Degree sum condition for the existence of spanning k-trees in star-free graphs. Discuss. Math. Graph Theory 42(1): 5-13 (2022) - [j18]Taisei Ito, Shoichi Tsuchiya:
Degree sum conditions for the existence of homeomorphically irreducible spanning trees. J. Graph Theory 99(1): 162-170 (2022) - 2020
- [j17]Michitaka Furuya, Shoichi Tsuchiya:
Large homeomorphically irreducible trees in path-free graphs. J. Graph Theory 93(3): 372-394 (2020)
2010 – 2019
- 2019
- [j16]Shipeng Wang, Shoichi Tsuchiya, Liming Xiong:
Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs. Graphs Comb. 35(2): 419-426 (2019) - [j15]Guantao Chen, Michitaka Furuya, Songling Shan, Shoichi Tsuchiya, Ping Yang:
Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw. Graphs Comb. 35(6): 1459-1474 (2019) - [j14]Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya:
Hamiltonicity of planar graphs with a forbidden minor. J. Graph Theory 90(4): 459-483 (2019) - [c1]Ei Ando, Shoichi Tsuchiya:
The Volume of a Crosspolytope Truncated by a Halfspace. TAMC 2019: 13-27 - 2018
- [j13]Ryo Nomura, Shoichi Tsuchiya:
Plane graphs without homeomorphically irreducible spanning trees. Ars Comb. 141: 157-165 (2018) - 2017
- [j12]Guantao Chen, Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya:
Forbidden Pairs and the Existence of a Spanning Halin Subgraph. Graphs Comb. 33(5): 1321-1345 (2017) - [j11]Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya:
Plane Triangulations Without a Spanning Halin Subgraph II. SIAM J. Discret. Math. 31(4): 2429-2439 (2017) - 2016
- [j10]Shoichi Tsuchiya:
Rooted HIST property on planar triangulations. Ars Comb. 126: 29-40 (2016) - [j9]Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Dominating Cycles and Forbidden Pairs Containing P5. Graphs Comb. 32(5): 1773-1788 (2016) - [j8]Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya:
A Characterization of K2, 4-Minor-Free Graphs. SIAM J. Discret. Math. 30(2): 955-975 (2016) - 2015
- [j7]Jennifer Diemunsch, Michitaka Furuya, Maryam Sharifzadeh, Shoichi Tsuchiya, David Wang, Jennifer Wise, Elyse Yeager:
A characterization of P5-free graphs with a homeomorphically irreducible spanning tree. Discret. Appl. Math. 185: 71-78 (2015) - [j6]Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Forbidden pairs and the existence of a dominating cycle. Discret. Math. 338(12): 2442-2452 (2015) - [j5]Michitaka Furuya, Shoichi Tsuchiya:
Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free. Graphs Comb. 31(6): 2201-2205 (2015) - [j4]Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya:
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs. SIAM J. Discret. Math. 29(3): 1423-1426 (2015) - 2013
- [j3]Michitaka Furuya, Shoichi Tsuchiya:
Forbidden subgraphs and the existence of a spanning tree without small degree stems. Discret. Math. 313(20): 2206-2212 (2013) - 2012
- [j2]Atsuhiro Nakamoto, Shoichi Tsuchiya:
A Face of a Projective Triangulation Removed for Its Geometric Realizability. Discret. Comput. Geom. 47(1): 215-234 (2012) - [j1]Atsuhiro Nakamoto, Shoichi Tsuchiya:
On geometrically realizable Möbius triangulations. Discret. Math. 312(14): 2135-2139 (2012)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2024-10-07 01:23 CEST 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:
