Every 3-connected {K(1,3), Z(7)}-free graph of order at least 21 is Hamilton-connected

Show simple item record
dc.contributor.authorRyjáček, Zdeněk
dc.contributor.authorVrána, Petr
dc.date.accessioned2021-06-14T14:21:56Z
dc.date.available2021-06-14T14:21:56Z
dc.date.issued2021
dc.description.abstract-translatedFor a positive integer i, Z(i) is the graph obtained by attaching an endvertex of a path of length i to a vertex of a triangle. We prove that every 3-connected {K(1,3), Z(7)}-free graph is Hamilton-connected, with one exceptional graph. The result is sharp.Ien
dc.format16 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationRYJÁČEK, Z., VRÁNA, P. Every 3-connected {K(1,3), Z(7)}-free graph of order at least 21 is Hamilton-connected. Discrete mathematics, 2021, roč. 344, č. 6. ISSN 0012-365X.cs
dc.identifier.document-number640570000020
dc.identifier.doi10.1016/j.disc.2021.112350
dc.identifier.issn0012-365X
dc.identifier.obd43932310
dc.identifier.uri2-s2.0-85101530411
dc.identifier.urihttp://hdl.handle.net/11025/43649
dc.language.isoenen
dc.project.IDLO1506/PUNTIS - Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnostcs
dc.project.IDGA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafycs
dc.publisherElsevieren
dc.relation.ispartofseriesDiscrete Mathematicsen
dc.rightsPlný text není přístupný.cs
dc.rights© Elsevieren
dc.rights.accessclosedAccessen
dc.subject.translatedHamilton-connecteden
dc.subject.translatedclosureen
dc.subject.translatedforbidden subgraphen
dc.subject.translatedclaw-freeen
dc.subject.translatedZ(i)-freeen
dc.titleEvery 3-connected {K(1,3), Z(7)}-free graph of order at least 21 is Hamilton-connecteden
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Collections

OBD
 Articles (KMA)
 Articles (NTIS)