SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

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 [a, b]-factors. [Citation Graph (0, 0)][DBLP]
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, b]-factors in graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2005, v:304, n:1-3, pp:51-61 [Journal]
Haruhide Matsuda
Fan-type results for the existence of [a, b]-factors. [Citation Graph (0, 0)][DBLP]
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 k-Tree Containing Specified Leaves in a Graph. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2006, v:22, n:3, pp:371-381 [Journal]
M. Kano, Haruhide Matsuda
A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III. [Citation Graph (0, 0)][DBLP]
CJCDGCGT, 2005, pp:70-78 [Conf]
Degree conditions and degree bounded trees. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.005secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP