| 2006 |
|---|
| 12 | | Jianxiang Li,
Haruhide Matsuda:
On (g, f, n)-Critical Graphs.
Ars Comb. 78: (2006) |
| 11 | EE | Haruhide Matsuda:
Fan-type results for the existence of [a, b]-factors.
Discrete Mathematics 306(7): 688-693 (2006) |
| 10 | EE | Haruhide Matsuda,
Hajime Matsumura:
On a k-Tree Containing Specified Leaves in a Graph.
Graphs and Combinatorics 22(3): 371-381 (2006) |
| 2005 |
|---|
| 9 | EE | M. Kano,
Haruhide Matsuda:
A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III.
CJCDGCGT 2005: 70-78 |
| 8 | EE | Haruhide Matsuda:
On 2-edge-connected [a, b]-factors of graphs with Ore-type condition.
Discrete Mathematics 296(2-3): 225-234 (2005) |
| 7 | EE | Haruhide Matsuda:
Ore-type conditions for the existence of even [2, b]-factors in graphs.
Discrete Mathematics 304(1-3): 51-61 (2005) |
| 2004 |
|---|
| 6 | EE | Haruhide Matsuda:
Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle.
Discrete Mathematics 280(1-3): 241-250 (2004) |
| 2003 |
|---|
| 5 | EE | Haruhide Matsuda:
Regular Factors Containing a Given Hamiltonian Cycle.
IJCCGGT 2003: 123-132 |
| 2002 |
|---|
| 4 | EE | Kiyoshi Ando,
Yoshimi Egawa,
Atsushi Kaneko,
Ken-ichi Kawarabayashi,
Haruhide Matsuda:
Path factors in claw-free graphs.
Discrete Mathematics 243(1-3): 195-200 (2002) |
| 3 | EE | Haruhide Matsuda:
A Neighborhood Condition for Graphs to Have [a, b]-Factors II.
Graphs and Combinatorics 18(4): 763-768 (2002) |
| 2001 |
|---|
| 2 | EE | M. Kano,
Haruhide Matsuda:
Partial Parity (g, ?f )-Factors and Subgraphs Covering Given Vertex Subsets.
Graphs and Combinatorics 17(3): 501-509 (2001) |
| 2000 |
|---|
| 1 | EE | Haruhide Matsuda:
A neighborhood condition for graphs to have [a, b]-factors.
Discrete Mathematics 224(1-3): 289-292 (2000) |
