Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected
| dc.contributor.author | Vrána, Petr | |
| dc.contributor.author | Zhan, Xingzhi | |
| dc.contributor.author | Zhang, Leilei | |
| dc.date.accessioned | 2022-12-05T11:00:17Z | |
| dc.date.available | 2022-12-05T11:00:17Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | V článku dokazujeme, že každý 3-souviský graf bez K(1,3) s číslem dominance nejvýše 3 je hamintonovsky souvislý. Výsledek je nejlepší možný a je inspirovaný hypotézou, kterou v roce 2020 publikovali Zheng, Broersma, Wang a Zhang. | cs |
| dc.description.abstract-translated | We prove that every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. The result is sharp and it is inspired by a conjecture posed by Zheng, Broersma, Wang and Zhang in 2020. | en |
| dc.format | 4 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | VRÁNA, P. ZHAN, X. ZHANG, L. Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. Discrete Mathematics, 2022, roč. 345, č. 8, s. nestránkováno. ISSN: 0012-365X | cs |
| dc.identifier.document-number | 792690200004 | |
| dc.identifier.doi | 10.1016/j.disc.2022.112909 | |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.obd | 43937026 | |
| dc.identifier.uri | 2-s2.0-85128850766 | |
| dc.identifier.uri | http://hdl.handle.net/11025/50532 | |
| dc.language.iso | en | en |
| dc.project.ID | GA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafy | cs |
| dc.publisher | Elsevier | en |
| dc.relation.ispartofseries | Discrete Mathematics | en |
| dc.rights | Plný text není přístupný. | cs |
| dc.rights | © Elsevier | en |
| dc.rights.access | closedAccess | en |
| dc.subject | Hamiltonovsky souvislý, graf bez K(1,3), číslo dominance | cs |
| dc.subject.translated | Hamiltonian-connected | en |
| dc.subject.translated | claw-free | en |
| dc.subject.translated | domination number | en |
| dc.title | Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected | en |
| dc.title.alternative | Každý 3-souviský graf bez K(1,3) s číslem dominance nejvýše 3 je hamiltonovsky souvislý | cs |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |