Zobrazeno 1 - 1
of 1
pro vyhledávání: '"G. V. Sarkisian"'
Autor:
G. V. Sarkisian, Armen S. Asratian
Publikováno v:
Graphs and Combinatorics. 12:209-219
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + d(v) ≥ |N(u) ∪ N(v) ∪ N(w)| for any pathuwv withuv ∉ E(G), whereN(x) is the neighborhood of a vertexx. We prove that a graphG with this condit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f951b92bc5b037039892daa27e6b9c8b
https://doi.org/10.1007/bf01858455
https://doi.org/10.1007/bf01858455
