Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Lukoťka, Robert | |
| dc.contributor.author | Rollová, Edita | |
| dc.date.accessioned | 2022-04-04T10:00:11Z | - |
| dc.date.available | 2022-04-04T10:00:11Z | - |
| dc.date.issued | 2022 | |
| dc.identifier.citation | LUKOŤKA, R. ROLLOVÁ, E. Perfect matchings in highly cyclically connected regular graphs. JOURNAL OF GRAPH THEORY, 2022, roč. 100, č. 1, s. 28-49. ISSN: 0364-9024 | cs |
| dc.identifier.issn | 0364-9024 | |
| dc.identifier.uri | 2-s2.0-85118139855 | |
| dc.identifier.uri | http://hdl.handle.net/11025/47312 | |
| dc.format | 22 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 | Perfect matchings in highly cyclically connected regular graphs | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.rights.access | closedAccess | en |
| dc.type.version | publishedVersion | en |
| dc.description.abstract-translated | A leaf matching operation on a graph consists of removing a vertex of degree 1 together with its neighbour from the graph. Let G be a d‐regular cyclically (d k − 1+2 )‐ edge‐connected graph of even order, where k ≥ 0 and d ≥ 3. We prove that for any given set X of d k − 1 + edges, there is no 1‐factor of G avoiding X if and only if either an isolated vertex can be obtained by a series of leaf matching operations in G − X, or G − X has an independent set that contains more than half of the vertices of G. To demonstrate how to check the conditions of the theorem we prove several statements on 2‐factors of cubic graphs. For k ≥ 3, we prove that given a cyclically (4k − 5)‐edge‐connected cubic graphG and three paths of length k such that the distance between any two of them is at least 8k − 16, there is a 2‐factor of G that contains one of the paths. We provide a similar statement for two paths when k = 3 and k = 4. As a corollary we show that given a vertex v in a cyclically 7‐edge‐connected cubic graph, there is a 2‐factor such that v is in a circuit of length greater than 7. | en |
| dc.subject.translated | 2‐factor | en |
| dc.subject.translated | cyclic connectivity | en |
| dc.subject.translated | perfect matching | en |
| dc.subject.translated | regular graph | en |
| dc.identifier.doi | 10.1002/jgt.22764 | |
| dc.type.status | Peer-reviewed | en |
| dc.identifier.document-number | 710868900001 | |
| dc.identifier.obd | 43935192 | |
| dc.project.ID | LO1506/PUNTIS - Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnost | cs |
| dc.project.ID | EE2.3.30.0038/Nová excelence lidských zdrojů | cs |
| Vyskytuje se v kolekcích: | Články / Articles (KMA) OBD | |
Soubory připojené k záznamu:
| Soubor | Velikost | Formát | |
|---|---|---|---|
| Journal of Graph Theory - 2021 - Luko ka - Perfect matchings in highly cyclically connected regular graphs.pdf | 782,81 kB | 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/47312Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.