5 citations · 15 across the 22 of their papers we have counts for
6 papers · 1 filter
Path-factors involving paths of order seven and nine
Yoshimi Egawa, Michitaka Furuya
In this paper, we show the following two theorems (here is the number of components of with ): (i)~If a graph satisfies $c_{1}(G-X)+\frac{1}{3}…
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 ) frequently appears as one of forbidden subgraphs. Recently, Furuya an…
The existence of a path-factor without small odd paths
Yoshimi Egawa, Michitaka Furuya
In this paper, we show that if a graph satisfies for all , then has a -f…
A New Approach Towards a Conjecture on Intersecting Three Longest Paths
Shinya Fujita, Michitaka Furuya, Reza Naserasr +1
In 1966, T. Gallai asked whether every connected graph has a vertex that appears in all longest paths. Since then this question has attracted much attention and many work has been…
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…
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…