|
発表年月
|
タイトル／共同研究者
|
掲載誌
|
巻・号・頁
|
学術機関等
|
| 2022/01 |
Degree sum condition for the existence of spanning k-trees in star-free graphs
Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima
|
Discussiones Mathematicae Graph Theory |
42巻
1号
5から
13ページまで
|
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora |
| 2021/01 |
A Fan-type condition for graphs to be k-leaf-connected.
Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda
|
Discrete Mathematics |
344巻
4号
112260から
112260ページまで
|
|
| 2019/07 |
[a b]-factors of graphs on surfaces
Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki
|
Discrete Mathematics |
342巻
7号
1979から
1988ページまで
|
|
| 2019/01 |
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves.
Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda
|
Graphs and Combinatorics |
35巻
1号
231から
238ページまで
|
|
| 2018/01 |
A spanning k-spider in a graph.
Ryota Matsubara, Haruhide Matsuda, Hajime Matsumura
|
Ars Combinatoria |
136巻
247から
253ページまで
|
|
| 2014/03 |
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph
Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita
|
Graphs and Combinatorics |
30巻
2号
429から
437ページまで
|
SPRINGER JAPAN KK |
| 2013/01 |
Spanning k-ended trees of bipartite graphs.
Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan
|
Discrete Mathematics |
313巻
24号
2903から
2907ページまで
|
|
| 2012/01 |
Spanning trees with a bounded number of leaves in a claw-free graph
Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita
|
Ars Combinatoria |
103巻
137から
154ページまで
|
CHARLES BABBAGE RES CTR |
| 2009/06 |
Degree conditions and degree bounded trees
Haruhide Matsuda, Hajime Matsumura
|
Discrete Mathematics |
309巻
11号
3653から
3658ページまで
|
ELSEVIER SCIENCE BV |
| 2008/02 |
On a spanning tree with specified leaves
Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto
|
Graphs and Combinatorics |
24巻
1号
13から
18ページまで
|
SPRINGER TOKYO |
| 2007/01 |
A Neighborhood Condition for Graphs to Have [a, b]-Factors III
M. Kano, Haruhide Matsuda
|
Discrete geometry, combinatorics and graph theory |
4381巻
4381号
70から
78ページまで
|
|
| 2006/11 |
On a k-tree containing specified leaves in a graph
Haruhide Matsuda, Hajime Matsumura
|
Graphs and Combinatorics |
22巻
3号
371から
381ページまで
|
SPRINGER TOKYO |
| 2006/04 |
Fan-type results for the existence of [a, b]-factors
Haruhide Matsuda
|
Discrete Mathematics |
306巻
7号
688から
693ページまで
|
|
| 2006/01 |
On (g, f, n)-critical graphs
JX Li, H Matsuda
|
Ars Combinatoria |
78巻
71から
82ページまで
|
CHARLES BABBAGE RES CTR |
| 2005/11 |
Ore-type conditions for the existence of even [2,b]-factors in graphs
Haruhide Matsuda
|
Discrete Mathematics |
304巻
1-3号
51から
61ページまで
|
|
| 2005/07 |
On 2-edge-connected |a, b|-factors of graphs with Ore-type condition
Haruhide Matsuda
|
Discrete Mathematics |
296巻
2-3号
225から
234ページまで
|
|
| 2005/01 |
Regular factors containing a given Hamiltonian cycle
H Matsuda
|
Combinatorial geometry and graph theory |
3330巻
123から
132ページまで
|
SPRINGER-VERLAG BERLIN |
| 2004/04 |
Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle
H Matsuda
|
Discrete Mathematics |
280巻
1-3号
241から
250ページまで
|
ELSEVIER SCIENCE BV |
| 2002/03 |
Path factors in cubic graphs
K Kawarabayashi, H Matsuda, Y Oda, K Ota
|
Journal of Graph Theory |
39巻
3号
188から
193ページまで
|
JOHN WILEY & SONS INC |
| 2002/01 |
Path factors in claw-free graphs
Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
|
Discrete Mathematics |
243巻
1-3号
195から
200ページまで
|
|
| 2002/01 |
Degree conditions for the existence of [k,k+1]-factors containing a given Hamiltonian cycle |
The Australasian Journal of Combinatorics |
26巻
273から
281ページまで
|
|
| 2002/01 |
A neighborhood condition for graphs to have [a, b]-factors II
Haruhide Matsuda
|
Graphs and Combinatorics |
18巻
4号
763から
768ページまで
|
|
| 2001/01 |
Partial parity (g, f)-factors and subgraphs covering given vertex subsets
M. Kano, Haruhide Matsuda
|
Graphs and Combinatorics |
17巻
3号
501から
509ページまで
|
Springer New York |
| 2000/09 |
A neighborhood condition for graphs to have [a,b]-factors
H Matsuda
|
Discrete Mathematics |
224巻
1-3号
289から
292ページまで
|
ELSEVIER SCIENCE BV |
| 1999/01 |
Some results on (1,f)-odd factors |
Combinatorics, Graph Theory, and Algorithms |
II巻
527から
533ページまで
|
|