Y. Egawa

collaborators

2 papers

math.CO2025

Spanning path-cycle systems with given end-vertices in regular graphs (full version)

Yoshimi Egawa, Mikio Kano, Kenta Ozeki

We prove the following theorem. Let $r \geq 4$ be an integer, and $G$ be a $K_{1, r}$ -free $r$ -edge-connected $r$ -regular graph. Then, for every set $W$ of even number of vertices of…

math.CO2024

Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth

Yoshimi Egawa, Michitaka Furuya

For a family $H$ of graphs, a graph $G$ is said to be {\it $H$ -free} if $G$ contains no member of $H$ as an induced subgraph. We let $\tilde{\mathcal{…