| Title: | Trestles in the squares of graphs |
| Authors: | Kabela, Adam Teska, Jakub |
| Citation: | KABELA, A. TESKA, J. Trestles in the squares of graphs. DISCRETE MATHEMATICS, 2021, roč. 344, č. 11, s. nestránkováno. ISSN: 0012-365X |
| Issue Date: | 2021 |
| Publisher: | Elsevier |
| Document type: | preprint preprint |
| URI: | 2-s2.0-85113154134 http://hdl.handle.net/11025/46283 |
| ISSN: | 0012-365X |
| Keywords in different language: | squares of graphs, Hamiltonicity, trestles, forbidden subgraphs |
| Abstract in different language: | 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. |
| Appears in Collections: | Preprinty / Preprints (KMA) OBD |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| 2002.12709.pdf | 306,07 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/46283Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.