The SCEAS System
| |||||||

## Search the dblp DataBase
Haruhide Matsuda:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Haruhide Matsuda
**Regular Factors Containing a Given Hamiltonian Cycle.**[Citation Graph (0, 0)][DBLP] IJCCGGT, 2003, pp:123-132 [Conf] - Jianxiang Li, Haruhide Matsuda
**On (g, f, n)-Critical Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2006, v:78, n:, pp:- [Journal] - Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
**Path factors in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:195-200 [Journal] - Haruhide Matsuda
**A neighborhood condition for graphs to have [**[Citation Graph (0, 0)][DBLP]*a, b*]-factors. Discrete Mathematics, 2000, v:224, n:1-3, pp:289-292 [Journal] - Haruhide Matsuda
**Degree conditions for Hamiltonian graphs to have [a, b]-factors containing a given Hamiltonian cycle.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:280, n:1-3, pp:241-250 [Journal] - Haruhide Matsuda
**On 2-edge-connected [a, b]-factors of graphs with Ore-type condition.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:296, n:2-3, pp:225-234 [Journal] - Haruhide Matsuda
**Ore-type conditions for the existence of even [2,**[Citation Graph (0, 0)][DBLP]*b*]-factors in graphs. Discrete Mathematics, 2005, v:304, n:1-3, pp:51-61 [Journal] - Haruhide Matsuda
**Fan-type results for the existence of [**[Citation Graph (0, 0)][DBLP]*a*,*b*]-factors. Discrete Mathematics, 2006, v:306, n:7, pp:688-693 [Journal] - M. Kano, Haruhide Matsuda
**Partial Parity (g, ?f )-Factors and Subgraphs Covering Given Vertex Subsets.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2001, v:17, n:3, pp:501-509 [Journal] - Haruhide Matsuda
**A Neighborhood Condition for Graphs to Have [a, b]-Factors II.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:4, pp:763-768 [Journal] - Haruhide Matsuda, Hajime Matsumura
**On a**[Citation Graph (0, 0)][DBLP]*k*-Tree Containing Specified Leaves in a Graph. Graphs and Combinatorics, 2006, v:22, n:3, pp:371-381 [Journal] - M. Kano, Haruhide Matsuda
**A Neighborhood Condition for Graphs to Have [**[Citation Graph (0, 0)][DBLP]*a*,*b*]-Factors III. CJCDGCGT, 2005, pp:70-78 [Conf] **Degree conditions and degree bounded trees.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |