Shoichi Tsuchiya

activity

20142026

most citedA new strategy for finding spanning trees without small degree stems

1 citations · 3 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2026

On the number of 4-contractible edges in plane triangulations

Toshiki Abe, Michitaka Furuya, Raiji Mukae +1

In 2007, Ando and Egawa proved a theorem which provides a lower bound on the number of contractible edges preserving $4$ -connectedness in $4$ -connected graphs. In this paper, we re…

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…

math.CO2016★ 1 cited

Hamiltonicity of planar graphs with a forbidden minor

M. N. Ellingham, Emily A. Marshall, Kenta Ozeki +1

Tutte showed that $4$ -connected planar graphs are Hamiltonian, but it is well known that $3$ -connected planar graphs need not be Hamiltonian. We show that $K_{2, 5}$ -minor-free $3$ -…

math.CO2015

Difference of forbidden pairs containing a claw

Guantao Chen, Michitaka Furuya, Songling Shan +2

When we study forbidden subgraph conditions guaranteeing graphs to have some properties, a claw (or $K_{1, 3}$ ) frequently appears as one of forbidden subgraphs. Recently, Furuya an…

math.CO2015

Dominating cycles and forbidden pairs containing a path of order 5

Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya

A cycle is a graph is dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate the characterization of the class of the forbidden…

math.CO2015★ 1 cited

Forbidden pairs and the existence of a dominating cycle

Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya

A cycle in a graph is called dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate forbidden pairs guaranteeing the existence…

math.CO2014

A characterization of $K_{2, 4}$ -minor-free graphs