M. Furuya

activity

20142026

most citedForbidden subgraphs for constant domination number

5 citations · 15 across the 22 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023★ 1 cited

A new strategy for finding spanning trees without small degree stems

Michitaka Furuya, Shoichi Tsuchiya

For an integer $k \geq 2$ , a spanning tree of a graph without vertices of degree from $2$ to $k$ is called a {\it $[2, k]$ -ST} of the graph. The concept of $[2, k]$ -STs is a natural e…

math.CO2023

Refinements of degree conditions for the existence of a spanning tree without small degree stems

Michitaka Furuya, Akira Saito, Shoichi Tsuchiya

A spanning tree of a graph without no vertices of degree $2$ is called a {\it homeomorphically irreducible spanning tree} (or a {\it HIST}) of the graph. Albertson, Berman, Hutchin…