Trestles in the squares of graphs

Adam Kabela, Jakub Teska

We show that the square of every connected $S(K_{1,4})$-free graph satisfying a matching condition has a $2$-connected spanning subgraph of maximum degree at most~$3$. Furthermore,…