Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Xia, Liu | |
dc.contributor.author | Ryjáček, Zdeněk | |
dc.contributor.author | Vrána, Petr | |
dc.contributor.author | Xiong, Liming | |
dc.contributor.author | Yang, Xiaojing | |
dc.date.accessioned | 2022-12-05T11:00:25Z | - |
dc.date.available | 2022-12-05T11:00:25Z | - |
dc.date.issued | 2023 | |
dc.identifier.citation | XIA, L. RYJÁČEK, Z. VRÁNA, P. XIONG, L. YANG, X. Hamilton‐connected {claw, net}‐free graphs, I. Journal of Graph Theory, 2023, roč. 102, č. 1, s. 154-179. ISSN: 0364-9024 | cs |
dc.identifier.issn | 0364-9024 | |
dc.identifier.uri | 2-s2.0-85135579270 | |
dc.identifier.uri | http://hdl.handle.net/11025/50546 | |
dc.format | 26 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Wiley | en |
dc.relation.ispartofseries | Journal of Graph Theory | en |
dc.rights | Plný text není přístupný. | cs |
dc.rights | © Wiley | en |
dc.title | Hamilton‐connected {claw, net}‐free graphs, I | en |
dc.title.alternative | | cs |
dc.type | článek | cs |
dc.type | article | en |
dc.rights.access | closedAccess | en |
dc.type.version | publishedVersion | en |
dc.description.abstract-translated | This is the first one in a series of two papers, in which we complete the characterization of forbidden generalized nets implying Hamilton‐connectedness of a 3‐connected claw‐free graph. In this paper, we first develop the necessary techniques that allow one to handle the problem, and, by a combination of these techniques, as an application, we prove that every 3‐connected {K(1,3), N(1,3,3)}‐free graph is Hamilton‐connected. The paper is followed by its second part in which we show that every 3‐connected {K(1,3), X}‐free graph, where X ∈ {N(1,1,5), N(2,2,3)}, is Hamilton‐connected. All the results on Hamilton‐connectedness are sharp. | en |
dc.subject.translated | claw‐free | en |
dc.subject.translated | closure | en |
dc.subject.translated | forbidden subgraph | en |
dc.subject.translated | Hamilton‐connected | en |
dc.subject.translated | net‐free | en |
dc.identifier.doi | 10.1002/jgt.22863 | |
dc.type.status | Peer-reviewed | en |
dc.identifier.document-number | 837157000001 | |
dc.identifier.obd | 43937187 | |
dc.project.ID | GA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafy | cs |
Vyskytuje se v kolekcích: | Články / Articles (KMA) Články / Articles (NTIS) OBD |
Soubory připojené k záznamu:
Soubor | Velikost | Formát | |
---|---|---|---|
17463931.pdf | 1,76 MB | Adobe PDF | Zobrazit/otevřít Vyžádat kopii |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/50546
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.