Citation Export
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Cho, Eun Kyung | - |
| dc.contributor.author | Choi, Ilkyoo | - |
| dc.contributor.author | Park, Boram | - |
| dc.date.issued | 2022-11-01 | - |
| dc.identifier.issn | 0012-365X | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/dev/handle/2018.oak/32764 | - |
| dc.description.abstract | Let G be a k-connected graph on n vertices. Hippchen's Conjecture (2008) states that two longest paths in G share at least k vertices. Gutiérrez (2020) recently proved the conjecture when k≤4 or [Formula presented]. We improve upon both results; namely, we show that two longest paths in G share at least k vertices when k=5 or [Formula presented]. This completely resolves two conjectures by Gutiérrez in the affirmative. | - |
| dc.description.sponsorship | Eun-Kyung Cho was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education ( NRF-2020R1I1A1A0105858711 ). Ilkyoo Choi was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education ( NRF-2018R1D1A1B07043049 ), and also by the Hankuk University of Foreign Studies Research Fund . Boram Park was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning ( NRF-2018R1C1B6003577 ). | - |
| dc.language.iso | eng | - |
| dc.publisher | Elsevier B.V. | - |
| dc.title | Improvements on Hippchen's conjecture | - |
| dc.type | Article | - |
| dc.citation.title | Discrete Mathematics | - |
| dc.citation.volume | 345 | - |
| dc.identifier.bibliographicCitation | Discrete Mathematics, Vol.345 | - |
| dc.identifier.doi | 10.1016/j.disc.2022.113029 | - |
| dc.identifier.scopusid | 2-s2.0-85132364562 | - |
| dc.identifier.url | http://www.journals.elsevier.com/discrete-mathematics/ | - |
| dc.subject.keyword | Hippchen's conjecture | - |
| dc.subject.keyword | k-connected graph | - |
| dc.subject.keyword | Longest path | - |
| dc.description.isoa | true | - |
| dc.subject.subarea | Theoretical Computer Science | - |
| dc.subject.subarea | Discrete Mathematics and Combinatorics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
