{
  "id": "2002.12709",
  "version": "v1",
  "published": "2020-02-28T13:38:05.000Z",
  "updated": "2020-02-28T13:38:05.000Z",
  "title": "Trestles in the squares of graphs",
  "authors": [
    "Adam Kabela",
    "Jakub Teska"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "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$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-02-28T13:38:05.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "free graphs",
      "maximum degree",
      "connected spanning subgraphs",
      "considering greater"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}