default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaruhide Matsuda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]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)- 2021
- [j21]Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda:
A Fan-type condition for graphs to be k-leaf-connected. Discret. Math. 344(4): 112260 (2021)
2010 – 2019
- 2019
- [j20]Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki:
[a, b]-factors of graphs on surfaces. Discret. Math. 342(7): 1979-1988 (2019) - [j19]Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda:
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves. Graphs Comb. 35(1): 231-238 (2019) - 2018
- [j18]Ryota Matsubara, Haruhide Matsuda, Hajime Matsumura:
A spanning k-spider in a graph. Ars Comb. 136: 247-253 (2018) - 2014
- [j17]Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita:
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. Graphs Comb. 30(2): 429-437 (2014) - 2013
- [j16]Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan:
Spanning k-ended trees of bipartite graphs. Discret. Math. 313(24): 2903-2907 (2013) - 2012
- [j15]Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita:
Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. 103: 137-154 (2012)
2000 – 2009
- 2009
- [j14]Haruhide Matsuda, Hajime Matsumura:
Degree conditions and degree bounded trees. Discret. Math. 309(11): 3653-3658 (2009) - 2008
- [j13]Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto:
On a Spanning Tree with Specified Leaves. Graphs Comb. 24(1): 13-18 (2008) - 2006
- [j12]Jianxiang Li, Haruhide Matsuda:
On (g, f, n)-Critical Graphs. Ars Comb. 78 (2006) - [j11]Haruhide Matsuda:
Fan-type results for the existence of [a, b]-factors. Discret. Math. 306(7): 688-693 (2006) - [j10]Haruhide Matsuda, Hajime Matsumura:
On a k-Tree Containing Specified Leaves in a Graph. Graphs Comb. 22(3): 371-381 (2006) - 2005
- [j9]Haruhide Matsuda:
On 2-edge-connected [a, b]-factors of graphs with Ore-type condition. Discret. Math. 296(2-3): 225-234 (2005) - [j8]Haruhide Matsuda:
Ore-type conditions for the existence of even [2, b]-factors in graphs. Discret. Math. 304(1-3): 51-61 (2005) - [c2]Mikio Kano, Haruhide Matsuda:
A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III. CJCDGCGT 2005: 70-78 - 2004
- [j7]Haruhide Matsuda:
Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle. Discret. Math. 280(1-3): 241-250 (2004) - 2003
- [c1]Haruhide Matsuda:
Regular Factors Containing a Given Hamiltonian Cycle. IJCCGGT 2003: 123-132 - 2002
- [j6]Haruhide Matsuda:
Degree conditions for the existence of [k, k+1]-factors containing a given Hamiltonian cycle. Australas. J Comb. 26: 273-282 (2002) - [j5]Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda:
Path factors in claw-free graphs. Discret. Math. 243(1-3): 195-200 (2002) - [j4]Haruhide Matsuda:
A Neighborhood Condition for Graphs to Have [a, b]-Factors II. Graphs Comb. 18(4): 763-768 (2002) - [j3]Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota:
Path factors in cubic graphs. J. Graph Theory 39(3): 188-193 (2002) - 2001
- [j2]Mikio Kano, Haruhide Matsuda:
Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets. Graphs Comb. 17(3): 501-509 (2001) - 2000
- [j1]Haruhide Matsuda:
A neighborhood condition for graphs to have [a, b]-factors. Discret. Math. 224(1-3): 289-292 (2000)
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-04-25 05:59 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:
