Research Output per year

## Research Output

## Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs

Furuya, M., Maezawa, S. I., Matsubara, R., Matsuda, H., Tsuchiya, S. & Yashima, T., 2020 Jan 1, (Accepted/In press) In : Discussiones Mathematicae - Graph Theory.Research output: Contribution to journal › Article

## [a,b]-factors of graphs on surfaces

Matsubara, R., Matsuda, H., Matsuo, N., Noguchi, K. & Ozeki, K., 2019 Jul 1, In : Discrete Mathematics. 342, 7, p. 1979-1988 10 p.Research output: Contribution to journal › Article

## Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves

Maezawa, S. I., Matsubara, R. & Matsuda, H., 2019 Jan 2, In : Graphs and Combinatorics. 35, 1, p. 231-238 8 p.Research output: Contribution to journal › Article

## A spanning k-spider in a graph

Matsubara, R., Matsuda, H. & Matsumura, H., 2018 Jan 1, In : Ars Combinatoria. 136, p. 247-253 7 p.Research output: Contribution to journal › Article

## Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph

Matsuda, H., Ozeki, K. & Yamashita, T., 2014 Mar 1, In : Graphs and Combinatorics. 30, 2, p. 429-437 9 p.Research output: Contribution to journal › Article

## Spanning k-ended trees of bipartite graphs

Kano, M., Matsuda, H., Tsugaki, M. & Yan, G., 2013 Oct 7, In : Discrete Mathematics. 313, 24, p. 2903-2907 5 p.Research output: Contribution to journal › Article

## Spanning trees with a bounded number of leaves in a claw-free graph

Kano, M., Kyaw, A., Matsuda, H., Ozeki, K., Saito, A. & Yamashita, T., 2012 Jan 1, In : Ars Combinatoria. 103, p. 137-154 18 p.Research output: Contribution to journal › Article

## Toughness and the existence of [a,b]-factors

Matsuda, H., 2012 Aug 11, In : Workshop on Discrete Mathematics and its applications, 2012.Research output: Contribution to journal › Article

## Trees with constraints on the leaf degree

Matsuda, H. & Matsubara, R., 2012 Jun 2, In : Default journal.Research output: Contribution to journal › Article

## On a tree with restricted degrees

Matsuda, H., 2011 Oct 5, In : Default journal.Research output: Contribution to journal › Article

## Degree conditions and degree bounded trees

Matsuda, H. & Matsumura, H., 2009 Jun 6, In : Discrete Mathematics. 309, 11, p. 3653-3658 6 p.Research output: Contribution to journal › Article

## On a spanning tree with specified leaves

Egawa, Y., Matsuda, H., Yamashita, T. & Yoshimoto, K., 2008 Feb 1, In : Graphs and Combinatorics. 24, 1, p. 13-18 6 p.Research output: Contribution to journal › Article

## A neighborhood condition for graphs to have [a,b]-factors III

Kano, M. & Matsuda, H., 2007 Mar 1, In : Discrete Geometry, Combinatorics and Graph Theory. p. 70-78Research output: Contribution to journal › Article

## A degree condition for Hamiltonian k-factors

Matsuda, H. & Egawa, Y., 2006 Aug 3, In : Default journal.Research output: Contribution to journal › Article

## Fan-type results for the existence of [a,b]-factors

Matsuda, H., 2006 Apr 1, In : Discrete Mathematics. 306, p. 688-693Research output: Contribution to journal › Article

## Fan-type results for the existence of [ a, b ]-factors

Matsuda, H., 2006 Apr 28, In : Discrete Mathematics. 306, 7, p. 688-693 6 p.Research output: Contribution to journal › Article

## On (g,f,n)-critical graphs

Matsuda, H. & Li, J., 2006 Feb 1, In : Ars Combinatoria. 78, p. 71-82Research output: Contribution to journal › Article

## On (g, f, n)-critical graphs

Li, J. & Matsuda, H., 2006 Jan 1, In : Ars Combinatoria. 78, p. 71-82 12 p.Research output: Contribution to journal › Article

## On a k-tree containing specified leaves in a graph

Matsuda, H. & Matsumura, H., 2006 Nov 1, In : Graphs and Combinatorics. 22, 3, p. 371-381 11 p.Research output: Contribution to journal › Article

## On k-trees containing specified leaves with an Ore-type condition

Matsuda, H. & Matsumura, H., 2006 Nov 1, In : Graphs and Combinatorics. 22, p. 371-381Research output: Contribution to journal › Article

## A neighborhood condition for graphs to have [a, b]-factors Ⅲ

Matsuda, H. & Kano, M., 2005 Nov 23, In : Default journal.Research output: Contribution to journal › Article

## On 2-edge-connected [a,b]-factors of graphs with Ore-type condition

Matsuda, H., 2005 Jul 1, In : Discrete Mathematics. 296, p. 225-234Research output: Contribution to journal › Article

## On 2-edge-connected |a, b|-factors of graphs with Ore-type condition

Matsuda, H., 2005 Jul 6, In : Discrete Mathematics. 296, 2-3, p. 225-234 10 p.Research output: Contribution to journal › Article

## Ore-type conditions for the existence of even [2,b]-factors

Matsuda, H., 2005 Nov 1, In : Discrete Mathematics. 304, p. 51-61Research output: Contribution to journal › Article

## Ore-type conditions for the existence of even [2,b]-factors in graphs

Matsuda, H., 2005 Nov 28, In : Discrete Mathematics. 304, 1-3, p. 51-61 11 p.Research output: Contribution to journal › Article

## Degree conditions for Hamiltonian graphs to have [a,b] -factors containing a given Hamiltonian cycle

Matsuda, H., 2004 Apr 6, In : Discrete Mathematics. 280, 1-3, p. 241-250 10 p.Research output: Contribution to journal › Article

## Degree conditions for the existence of [a,b]-factors containing a given Hamiltonian cycle

Matsuda, H., 2004 Apr 1, In : Discrete Mathematics. 280, p. 241-250Research output: Contribution to journal › Article

## Neighborhood conditions for the existence of (g,f)-factors

Matsuda, H., 2004 May 1, In : Mathematical Journal of Ibaraki University. p. 1-4Research output: Contribution to journal › Article

## A neighborhood condition for graphs to have [a,b]-factors II

Matsuda, H., 2002 Dec 1, In : Graphs and Combinatorics. 18, p. 763-768Research output: Contribution to journal › Article

## A neighborhood condition for graphs to have [a, b]-factors II

Matsuda, H., 2002 Dec 1, In : Graphs and Combinatorics. 18, 4, p. 763-768 6 p.Research output: Contribution to journal › Article

## Degree conditions for the existence of [a, b]-factors containing a given Hamiltonian cycle

Matsuda, H., 2002 Sep 12, In : Default journal. p. 6Research output: Contribution to journal › Article

## Degree conditions for the existence of [k,k+1]-factors containing a given Hamiltonian cycle

Matsuda, H., 2002 Sep 1, In : The Australasian Journal of Combinatorics. 26, p. 273-281Research output: Contribution to journal › Article

## Degree conditions for the existence of [k, k + 1]-factors containing a given Hamiltonian cycle

Matsuda, H., 2002 Dec 1, In : Australasian Journal of Combinatorics. 26, p. 273-281 9 p.Research output: Contribution to journal › Article

## Path factors in claw-free graphs

Ando, K., Egawa, Y., Kaneko, A., Kawarabayashi, K. & Matsuda, H., 2002 Jan 1, In : Discrete Mathematics. 243, p. 195-200Research output: Contribution to journal › Article

## Path factors in cubic graphs

Kawarabayashi, K., Matsuda, H., Oda, Y. & Ota, K., 2002 Mar 1, In : Journal of Graph Theory. 39, p. 188-193Research output: Contribution to journal › Article

## Neighborhood unions and odd factor critical graphs

Matsuda, H., 2001 Mar 1, In : Bulletin of Nakamura Gakuen University and Nakamura Gakuen Junior College. p. 221-224Research output: Contribution to journal › Article

## Partial parity (g,f)-factors and subgraphs covering given vertex subsets

Kano, M. & Matsuda, H., 2001 Sep 1, In : Graphs and Combinatorics. 17, p. 501-509Research output: Contribution to journal › Article

## Partial parity (g, f)-factors and subgraphs covering given vertex subsets

Kano, M. & Matsuda, H., 2001 Jan 1, In : Graphs and Combinatorics. 17, 3, p. 501-509 9 p.Research output: Contribution to journal › Article

## A neighborhood condition for graphs to have [a,b]-factors

Matsuda, H., 2000 Sep 1, In : Discrete Mathematics. 224, p. 289-292Research output: Contribution to journal › Article

## A neighborhood condition for graphs to have [a, b]-factors

Matsuda, H., 2000 Sep 28, In : Discrete Mathematics. 224, 1-3, p. 289-292 4 p.Research output: Contribution to journal › Article

## Some results on (1,f)-odd factors

Kano, M. & Matsuda, H., 1999 Sep 1, In : Combinatorics, Graph Theory, and Algorithms. II, p. 527-533Research output: Contribution to journal › Article