论文标题
图形的正方形
Trestles in the squares of graphs
论文作者
论文摘要
我们表明，每个连接的$ s（k_ {1,4}）$ - 满足匹配条件的免费图具有$ 2 $连接的跨度子图，最高为〜$ 3 $。此外，我们表征了树木的广场，其$ 2 $连接的跨度子图最高为〜$ k $。这将结果概括为$ s（k_ {1,3}）$ - 分别为Henry and Vogler（1985）和Harary and Schwenk（1971）的免费图。
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, we characterise trees whose square has a $2$-connected spanning subgraph of maximum degree at most~$k$. This generalises the results on $S(K_{1,3})$-free graphs of Henry and Vogler (1985) and Harary and Schwenk (1971), respectively.
