Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs
From MaRDI portal
Publication:5024671
DOI10.46298/DMTCS.5851zbMath1481.05062arXiv1910.05542OpenAlexW2980110379MaRDI QIDQ5024671
Linxin Wu, Wei Meng, Ruixia Wang
Publication date: 27 January 2022
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.05542
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- A degree condition for cycles of maximum length in bipartite digraphs
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- New sufficient conditions for bipancyclicity of balanced bipartite digraphs
- Cycles and paths in bipartite tournaments with spanning configurations
- A degree sum condition for Hamiltonicity in balanced bipartite digraphs
- A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
- A sufficient condition for a balanced bipartite digraph to be hamiltonian
- On the Meyniel condition for hamiltonicity in bipartite digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs