Person:222629: Difference between revisions

From MaRDI portal
Person:222629
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Haruhide Matsuda to Haruhide Matsuda: Duplicate
 
(No difference)

Latest revision as of 10:59, 9 December 2023

Available identifiers

zbMath Open matsuda.haruhideMaRDI QIDQ222629

List of research outcomes





PublicationDate of PublicationType
Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs2022-01-03Paper
A Fan-type condition for graphs to be \(k\)-leaf-connected2021-03-25Paper
\([a,b\)-factors of graphs on surfaces]2019-06-18Paper
Degree conditions for graphs to have spanning trees with few branch vertices and leaves2019-03-21Paper
https://portal.mardi4nfdi.de/entity/Q45682022018-06-15Paper
Spanning trees with a bounded number of branch vertices in a claw-free graph2014-09-19Paper
Spanning \(k\)-ended trees of bipartite graphs2014-01-27Paper
https://portal.mardi4nfdi.de/entity/Q48974732012-12-19Paper
Path factors in cubic graphs2009-12-08Paper
Degree conditions and degree bounded trees2009-06-19Paper
On a spanning tree with specified leaves2008-04-16Paper
A Neighborhood Condition for Graphs to Have [a, b-Factors III]2007-08-28Paper
On a \(k\)-tree containing specified leaves in a graph2007-01-05Paper
https://portal.mardi4nfdi.de/entity/Q54926032006-10-16Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Fan-type results for the existence of [\(a\),\(b\)-factors]2006-05-16Paper
Ore-type conditions for the existence of even \([2,b\)-factors in graphs]2005-12-29Paper
Neighborhood conditions for the existence of (g, f)-factors2005-09-30Paper
On 2-edge-connected \([\mathbf{a,b}\)-factors of graphs with Ore-type condition]2005-08-17Paper
Degree conditions for Hamiltonian graphs to have \([a,b\)-factors containing a given Hamiltonian cycle]2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q47805242003-10-26Paper
A neighborhood condition for graphs to have \([a, b\)-factors. II]2003-03-27Paper
Path factors in claw-free graphs2002-03-13Paper
Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets2002-01-09Paper
A neighbourhood condition for graphs to have \([a,b\)-factors]2001-08-16Paper

Research outcomes over time

This page was built for person: Haruhide Matsuda