On Hamiltonian Bypasses in Digraphs satisfying Meyniel-like Condition

arXiv2301.06361MaRDI QIDQ6423486FDOQ6423486

Authors: Samvel Kh. Darbinyan 

Publication date: 16 January 2023

Abstract: Let $G$ be a strongly connected directed graph of order $pgeq3$. In this paper, we show that if $d(x)+d(y)geq2p-2$ (respectively, $d(x)+d(y)geq2p-1$) for every pair of non-adjacent vertices $x,y$, then $G$ contains a Hamiltonian path (with only a few exceptional cases that can be clearly characterized) in which the initial vertex dominates the terminal vertex (respectively, $G$ contains two distinct verteces $x$ and $y$ such that there are two internally disjoint $(x,y)$-paths of lengths $p-2$ and $2$).

This page was built for publication: On Hamiltonian Bypasses in Digraphs satisfying Meyniel-like Condition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423486)