The most general structure of graphs with hamiltonian or hamiltonian connected square

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F24%3A43969807" target="_blank" >RIV/49777513:23520/24:43969807 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0012365X23003886" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0012365X23003886</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2023.113702" target="_blank" >10.1016/j.disc.2023.113702</a>

Result language
angličtina
Original language name
The most general structure of graphs with hamiltonian or hamiltonian connected square
Original language description
On the basis of recent results on hamiltonicity, [5], and hamiltonian connectedness, [9], in the square of a 2-block, we determine the most general block-cutvertex structure a graph G may have in order to guarantee that G^2 is hamiltonian, hamiltonian connected, respectively. Such an approach was already developed in [10] for hamiltonian total 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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)