Akira Saito

activity

20132023

most citedSpanning trails with maximum degree at most 4 in

2 K_{2}

-free graphs

2 citations · 3 across the 5 of their papers we have counts for

collaborators

Showing 2016Show all

1 paper · 1 filter

math.CO2016★ 2 cited

Spanning trails with maximum degree at most 4 in $2 K_{2}$ -free graphs

Guantao Chen, M. N. Ellingham, Akira Saito +1

A graph is called $2 K_{2}$ -free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every $\frac{3}{2}$ -tough $2 K_{2}$ -free graph wi…

Spanning trails with maximum degree at most 4 in 2K2​-free graphs

Spanning trails with maximum degree at most 4 in $2 K_{2}$ -free graphs