On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
From MaRDI portal
Publication:2222944
Abstract: We prove several new sufficient conditions for hamiltonicity and bipancyclicity in balanced bipartite digraphs, in terms of sums of degrees over dominating or dominated pairs of vertices.
Cites work
- A degree sum condition for Hamiltonicity in balanced bipartite digraphs
- A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
- A sufficient condition for a balanced bipartite digraph to be Hamiltonian
- An Ore-type condition implying a digraph to be pancyclic
- Digraphs
- scientific article; zbMATH DE number 7225861 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 908788 (Why is no real title available?)
- New sufficient conditions for bipancyclicity of balanced bipartite digraphs
- On the Meyniel condition for Hamiltonicity in bipartite digraphs
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
Cited in
(4)- A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
- scientific article; zbMATH DE number 7225861 (Why is no real title available?)
- A new sufficient condition for a 2-strong digraph to be Hamiltonian
- Cycles of many lengths in balanced bipartite digraphs on dominating and dominated degree conditions
This page was built for publication: On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222944)