Adam Kabela, Jakub Teska
Published 2020-02-28Version 1
We study the squares of $S(K_{1,k+1})$-free graphs and their $2$-connected spanning subgraphs of maximum degree at most $k$. We view the results of Harary and Schwenk (1971) and Henry and Vogler (1985) as the case $k = 2$ of this study, and we generalize these results by considering greater $k$.
On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs
On the number of forests and connected spanning subgraphs
Some Results on $k$-Critical $P_5$-Free Graphs
![QR code for arXiv:2002.12709 [math.CO]](http://oss.arxitics.com/images/favicon.svg)