Quasigraphs and skeletal partitions

Show simple item record
dc.contributor.authorKaiser, Tomáš
dc.contributor.authorVrána, Petr
dc.date.accessioned2022-12-19T11:00:11Z
dc.date.available2022-12-19T11:00:11Z
dc.date.issued2023
dc.description.abstract-translatedWe give a new proof of the Skeletal Lemma, which is the main technical tool in our paper on Hamilton cycles in line graphs (Kaiser and Vrána, 2012). It generalises results on disjoint spanning trees in graphs to the context of 3-hypergraphs. The lemma is proved in a slightly stronger version that is more suitable for applications. The proof is simplified and formulated in a more accessible way.en
dc.format18 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationKAISER, T. VRÁNA, P. Quasigraphs and skeletal partitions. EUROPEAN JOURNAL OF COMBINATORICS, 2023, roč. 107, č. January, s. nestránkováno. ISSN: 0195-6698cs
dc.identifier.document-number877214000003
dc.identifier.doi10.1016/j.ejc.2022.103563
dc.identifier.issn0195-6698
dc.identifier.obd43937191
dc.identifier.uri2-s2.0-85136494292
dc.identifier.urihttp://hdl.handle.net/11025/50748
dc.language.isoenen
dc.project.IDGA20-09525S/Strukturální vlastnosti tříd grafů charakterizovaných zakázanými indukovanými podgrafycs
dc.publisherAcademic Pressen
dc.relation.ispartofseriesEuropean Journal Of Combinatoricsen
dc.rights© Elsevieren
dc.rights.accessopenAccessen
dc.subject.translatedquasigraphen
dc.subject.translatedspanning treeen
dc.subject.translatedconnectivityen
dc.titleQuasigraphs and skeletal partitionsen
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:
1-s2.0-S0195669822000609-main.pdf
Size:
478.8 KB
Format:
Adobe Portable Document Format
Download

Collections

Articles (KMA)