Trestles in the squares of graphs
| Autoři | |
|---|---|
| Rok publikování | 2021 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Discrete Mathematics |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | http://dx.doi.org/10.1016/j.disc.2021.112532 |
| Doi | http://dx.doi.org/10.1016/j.disc.2021.112532 |
| Klíčová slova | Squares of graphs; Hamiltonicity; Trestles; Forbidden subgraphs |
| Popis | We show that the square of every connected -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 -free graphs of Henry and Vogler [7] and Harary and Schwenk [6], respectively. |
| Související projekty: |