Hamilton cycles in line graphs of 3-hypergraphs

Show simple item record
dc.contributor.authorKaiser, Tomáš
dc.contributor.authorVrána, Petr
dc.date.accessioned2022-09-12T10:00:23Z
dc.date.available2022-09-12T10:00:23Z
dc.date.issued2022
dc.description.abstract-translatedWe prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs.en
dc.format4 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationKAISER, T. VRÁNA, P. Hamilton cycles in line graphs of 3-hypergraphs. Discrete Mathematics, 2022, roč. 345, č. 10, s. 113028. ISSN: 0012-365Xcs
dc.identifier.document-number831721100005
dc.identifier.doi10.1016/j.disc.2022.113028
dc.identifier.issn0012-365X
dc.identifier.obd43936504
dc.identifier.uri2-s2.0-85131452019
dc.identifier.urihttp://hdl.handle.net/11025/49636
dc.language.isoenen
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.rights© Elsevieren
dc.rights.accessopenAccessen
dc.subject.translatedHamilton cycleen
dc.subject.translatedline graphen
dc.subject.translated3-hypergraphen
dc.titleHamilton cycles in line graphs of 3-hypergraphsen
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Collections

OBD
 Articles (KMA)
 Articles (NTIS)