Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Ekstein, Jan | |
| dc.contributor.author | Fujita, Shinya | |
| dc.contributor.author | Kabela, Adam | |
| dc.contributor.author | Teska, Jakub | |
| dc.date.accessioned | 2018-06-21T10:00:14Z | - |
| dc.date.available | 2018-06-21T10:00:14Z | - |
| dc.date.issued | 2018 | |
| dc.identifier.citation | EKSTEIN, J., FUJITA, S., KABELA, A., TESKA, J. Bounding the distance among longest paths in a connected graph. DISCRETE MATHEMATICS, 2018, roč. 341, č. 4, s. 1155-1159. ISSN: 0012-365X | en |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.uri | 2-s2.0-85033482578 | |
| dc.identifier.uri | http://hdl.handle.net/11025/29791 | |
| dc.format | 5 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.relation.ispartofseries | Discrete Mathematics | en |
| dc.rights | © Elsevier | en |
| dc.title | Bounding the distance among longest paths in a connected graph | en |
| dc.type | postprint | cs |
| dc.type | postprint | en |
| dc.rights.access | openAccess | en |
| dc.type.version | acceptedVersion | en |
| dc.description.abstract-translated | It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k >= 7, Skupień in 1966 obtained a connected graph in which some longest paths have no common vertex, but every k - 1 longest paths have a common vertex. It is not known whether every 3 longest paths in a connected graph have a common vertex and similarly for 4, 5, and 6 longest path. Fujita et al. in 2015 give an upper bound on distance among 3 longest paths in a connected graph. In this paper we give a similar upper bound on distance between 4 longest paths and also for k longest paths, in general. | en |
| dc.subject.translated | Longest paths | en |
| dc.subject.translated | Path intersection | en |
| dc.identifier.doi | 10.1016/j.disc.2017.09.029 | |
| dc.type.status | Peer-reviewed | en |
| dc.identifier.document-number | 427664600035 | |
| dc.identifier.obd | 43922004 | |
| dc.project.ID | LO1506/PUNTIS - Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnost | cs |
| dc.project.ID | GA14-19503S/Barevnost a struktura grafů | cs |
| dc.project.ID | SGS-2016-003/Kvalitativní a kvantitativní studium matematických modelů III. | cs |
| Vyskytuje se v kolekcích: | Články / Articles (KMA) OBD | |
Soubory připojené k záznamu:
| Soubor | Velikost | Formát | |
|---|---|---|---|
| 1607.08850v2.pdf | 148,75 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/29791Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.