A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs

DOI10.1007/S00373-018-1907-7MaRDI QIDQ2413636zbMATH OpenOpenAlexWikidataFDO

Authors Janusz Adamus

Publication date 14 September 2018

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

cycledigraphbipancyclicitydegree conditionbipartite digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Abstract: We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$, $ageq3$, satisfying $d(u)+d(v)geq3a$ for every pair of vertices $u,v$ with a common in-neighbour or a common out-neighbour, is either bipancyclic or a directed cycle of length $2a$.

Recommendations

• Sufficient conditions for a balanced bipartite digraph to be even pancyclic
• On the Meyniel condition for Hamiltonicity in bipartite digraphs
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs

Cites work

• scientific article; zbMATH DE number 908788 (Why is no real title available?)
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs
• A new sufficient condition for a digraph to be Hamiltonian
• A sufficient condition for a balanced bipartite digraph to be Hamiltonian
• An Ore-type condition implying a digraph to be pancyclic
• Digraphs
• On the Meyniel condition for Hamiltonicity in bipartite digraphs

Cited in

(9)

• Disjoint Cycles in a Digraph with Partial Degree
• A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
• Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
• Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• scientific article; zbMATH DE number 7225861 (Why is no real title available?)
• scientific article; zbMATH DE number 3993611 (Why is no real title available?)
• On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic

This page was built for publication: A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs

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