Sufficient conditions for a balanced bipartite digraph to be even pancyclic

DOI10.1016/j.dam.2017.12.013zbMath1380.05085OpenAlexW2782285325MaRDI QIDQ1701114

Samvel Kh. Darbinyan

Publication date: 22 February 2018

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

Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.013

zbMATH Keywords

cyclesHamiltonian cyclesdigraphspancycliclongest non-Hamiltonian cyclesbipartite balanced digrapheven pancyclic

Mathematics Subject Classification ID

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

Related Items (1)

Sufficient conditions for Hamiltonian cycles in bipartite digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles and paths of many lengths in bipartite digraphs
• Cycles in bipartite tournaments
• 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
• On pancyclic digraphs
• Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Long Cycles in Digraphs
• 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: Sufficient conditions for a balanced bipartite digraph to be even pancyclic