| Title: | Hamilton‐connected {claw, bull}‐free graphs |
| Authors: | Ryjáček, Zdeněk Vrána, Petr |
| Citation: | RYJÁČEK, Z. VRÁNA, P. Hamilton‐connected {claw, bull}‐free graphs. Journal of Graph Theory, 2023, roč. 102, č. 1, s. 128-153. ISSN: 0364-9024 |
| Issue Date: | 2023 |
| Publisher: | Wiley |
| Document type: | článek article |
| URI: | 2-s2.0-85135590970 http://hdl.handle.net/11025/50547 |
| ISSN: | 0364-9024 |
| Keywords in different language: | bull‐free;claw‐free;closure;forbidden subgraph;Hamilton‐connected |
| Abstract in different language: | The generalized bull is the graph B(i,j) obtained by attaching endvertices of two disjoint paths of lengths i, j to two vertices of a triangle. We prove that every 3‐connected {K(1,3), X}‐free graph, where X ∈ {B(1,6), B(2,5),B(3,4)}, is Hamilton‐connected. The results are sharp and complete the characterization of forbidden induced bulls implying Hamilton‐connectedness of a 3‐connected {claw, bull}‐free graph. |
| Rights: | Plný text není přístupný. © Wiley |
| Appears in Collections: | Články / Articles (KMA) Články / Articles (NTIS) OBD |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| 17463896.pdf | 1,19 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/50547Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.