Haruhide Matsuda

24 papers Journal 22Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Degree sum condition for the existence of spanning
Discuss. Math. Graph Theory
Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima
2021 J jnl
A Fan-type condition for graphs to be k-leaf-connected.
Discret. Math.
Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda
2019 J jnl
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves.
Graphs Comb.
Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda
2019 J jnl
[a, b]-factors of graphs on surfaces.
Discret. Math.
Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki
2018 J jnl
A spanning k-spider in a graph.
Ars Comb.
Ryota Matsubara, Haruhide Matsuda, Hajime Matsumura
2014 J jnl
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph.
Graphs Comb.
Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita
2013 J jnl
Spanning
Discret. Math.
Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan
2012 J jnl
Spanning trees with a bounded number of leaves in a claw-free graph.
Ars Comb.
Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita
2009 J jnl
Degree conditions and degree bounded trees.
Discret. Math.
Haruhide Matsuda, Hajime Matsumura
2008 J jnl
On a Spanning Tree with Specified Leaves.
Graphs Comb.
Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto
2006 J jnl
Fan-type results for the existence of [
Discret. Math.
Haruhide Matsuda
2006 J jnl
On (g, f, n)-Critical Graphs.
Ars Comb.
Jianxiang Li, Haruhide Matsuda
2006 J jnl
On a
Graphs Comb.
Haruhide Matsuda, Hajime Matsumura
2005 — conf
A Neighborhood Condition for Graphs to Have [
CJCDGCGT
Mikio Kano, Haruhide Matsuda
2005 J jnl
On 2-edge-connected [a, b]-factors of graphs with Ore-type condition.
Discret. Math.
Haruhide Matsuda
2005 J jnl
Ore-type conditions for the existence of even [2,
Discret. Math.
Haruhide Matsuda
2004 J jnl
Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle.
Discret. Math.
Haruhide Matsuda
2003 — conf
Regular Factors Containing a Given Hamiltonian Cycle.
IJCCGGT
Haruhide Matsuda
2002 J jnl
A Neighborhood Condition for Graphs to Have [a, b]-Factors II.
Graphs Comb.
Haruhide Matsuda
2002 J jnl
Degree conditions for the existence of [k, k+1]-factors containing a given Hamiltonian cycle.
Australas. J Comb.
Haruhide Matsuda
2002 J jnl
Path factors in claw-free graphs.
Discret. Math.
Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
2002 J jnl
Path factors in cubic graphs.
J. Graph Theory
Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota
2001 J jnl
Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets.
Graphs Comb.
Mikio Kano, Haruhide Matsuda
2000 J jnl
A neighborhood condition for graphs to have [
Discret. Math.
Haruhide Matsuda