A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs

DOI10.1007/S00373-018-1907-7zbMATH Open1395.05065arXiv1708.04674OpenAlexW3102731476WikidataQ129803530 ScholiaQ129803530MaRDI QIDQ2413636FDOQ2413636

Authors: Janusz Adamus 

Publication date: 14 September 2018

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

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$.

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

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

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)

Cites Work

• Digraphs
• An Ore-type condition implying a digraph to be pancyclic
• A new sufficient condition for a digraph to be Hamiltonian
• Title not available (Why is that?)
• A sufficient condition for a balanced bipartite digraph to be hamiltonian
• On the Meyniel condition for hamiltonicity in bipartite digraphs
• A degree sum condition for Hamiltonicity in balanced bipartite digraphs

Cited In (8)

• Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• Title not available (Why is that?)
• Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
• Disjoint Cycles in a Digraph with Partial Degree
• A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs
• On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs
• Title not available (Why is that?)

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)