The hamiltonicity of essentially 9-connected line graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F21%3A43961754" target="_blank" >RIV/49777513:23520/21:43961754 - isvavai.cz</a>
Result on the web
<a href="https://onlinelibrary.wiley.com/doi/10.1002/jgt.22653" target="_blank" >https://onlinelibrary.wiley.com/doi/10.1002/jgt.22653</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.22653" target="_blank" >10.1002/jgt.22653</a>

Result language
angličtina
Original language name
The hamiltonicity of essentially 9-connected line graphs
Original language description
Yang et al proved that every 3‐connected, essentially 11‐connected line graph is Hamilton‐connected. This was extended by Li and Yang to 3‐connected, essentially 10‐connected line graphs. Strengthening their result further, we prove that 3‐connected, essentially 9‐connected line graphs are Hamilton‐connected. We use a method based on quasigraphs in combination with the discharging technique. The result extends to claw‐free graphs.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GA17-04611S" target="_blank" >GA17-04611S: Ramsey-like aspects of graph coloring</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)