On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li

DOI10.1016/j.dam.2016.02.010zbMath1358.05124arXiv1207.5643OpenAlexW1624522051MaRDI QIDQ516779

I. A. Karapetyan, Samvel Kh. Darbinyan

Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.5643

zbMATH Keywords

cyclesHamiltonian cyclesdigraphslongest non-Hamiltonian cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
• An Ore-type condition implying a digraph to be pancyclic
• A short proof of Meyniel's theorem
• A theorem on pancyclic-oriented graphs
• A new sufficient condition for a digraph to be Hamiltonian
• A classification of locally semicomplete digraphs
• On pancyclic digraphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Long Cycles in Digraphs
• Cycles in digraphs– a survey
• Directed hamiltonian graphs
• On the pancyclicity of digraphs with large semi-degrees
• A sufficient condition for the hamiltonian property of digraphs with large semi-degrees
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li