A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
Y. Manoussakis (J. Graph Theory 16, 1992, 51-59) proposed the following conjecture. \noindent\textbf{Conjecture}. {\it Let $D$ be a 2-strongly connected digraph of order $n$ such that for all distinct pairs of non-adjacent vertices $x$, $y$ and $w$, $z$, we have $d(x)+d(y)+d(w)+d(z)\geq 4n-3$. The...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Discrete Mathematics & Theoretical Computer Science
2021-01-01
|
| Col·lecció: | Discrete Mathematics & Theoretical Computer Science |
| Matèries: | |
| Accés en línia: | https://dmtcs.episciences.org/6086/pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|