Hamilton‐connected {claw, bull}‐free graphs

Show simple item record
dc.contributor.authorRyjáček, Zdeněk
dc.contributor.authorVrána, Petr
dc.date.accessioned2022-12-05T11:00:25Z
dc.date.available2022-12-05T11:00:25Z
dc.date.issued2023
dc.description.abstract-translatedThe 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.en
dc.format26 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationRYJÁČEK, Z. VRÁNA, P. Hamilton‐connected {claw, bull}‐free graphs. Journal of Graph Theory, 2023, roč. 102, č. 1, s. 128-153. ISSN: 0364-9024cs
dc.identifier.document-number837480500001
dc.identifier.doi10.1002/jgt.22861
dc.identifier.issn0364-9024
dc.identifier.obd43937188
dc.identifier.uri2-s2.0-85135590970
dc.identifier.urihttp://hdl.handle.net/11025/50547
dc.language.isoenen
dc.project.IDGA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafycs
dc.publisherWileyen
dc.relation.ispartofseriesJournal of Graph Theoryen
dc.rightsPlný text není přístupný.cs
dc.rights© Wileyen
dc.rights.accessclosedAccessen
dc.subject.translatedbull‐freeen
dc.subject.translatedclaw‐freeen
dc.subject.translatedclosureen
dc.subject.translatedforbidden subgraphen
dc.subject.translatedHamilton‐connecteden
dc.titleHamilton‐connected {claw, bull}‐free graphsen
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
17463896.pdf
Size:
1.17 MB
Format:
Adobe Portable Document Format
Download

Collections

Articles (KMA)
 Articles (NTIS)