The hamiltonicity of essentially 9-connected line graphs
| dc.contributor.author | Kaiser, Tomáš | |
| dc.contributor.author | Vrána, Petr | |
| dc.date.accessioned | 2021-10-11T10:00:10Z | |
| dc.date.available | 2021-10-11T10:00:10Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract-translated | Yang et al proved that every 3‐connected, essentially 11‐connected line graph is Hamilton‐connected. This was extended by Li and Yang to 3‐connected, essentially 10‐connected line graphs. Strengthening their result further, we prove that 3‐connected, essentially 9‐connected line graphs are Hamilton‐connected. We use a method based on quasigraphs in combination with the discharging technique. The result extends to claw‐free graphs. | en |
| dc.format | 19 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | KAISER, T. VRÁNA, P. The hamiltonicity of essentially 9-connected line graphs. Journal of Graph Theory, 2021, roč. 97, č. 2, s. 241-259. ISSN: 0364-9024 | cs |
| dc.identifier.document-number | 596678100001 | |
| dc.identifier.doi | 10.1002/jgt.22653 | |
| dc.identifier.issn | 0364-9024 | |
| dc.identifier.obd | 43932753 | |
| dc.identifier.uri | 2-s2.0-85097146993 | |
| dc.identifier.uri | http://hdl.handle.net/11025/45434 | |
| dc.language.iso | en | en |
| dc.project.ID | GA17-04611S/Ramseyovské aspekty barvení grafů | cs |
| dc.publisher | Wiley | en |
| dc.relation.ispartofseries | Journal of Graph Theory | en |
| dc.rights | © Wiley | cs |
| dc.subject.translated | essential edge-connectivity | en |
| dc.subject.translated | Hamilton-connectivity | en |
| dc.subject.translated | Hamilton cycle | en |
| dc.subject.translated | line graph | en |
| dc.title | The hamiltonicity of essentially 9-connected line graphs | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |