New sufficient conditions for bipancyclicity of balanced bipartite digraphs

DOI10.1016/J.DISC.2018.08.004zbMATH Open1395.05073OpenAlexW2890514817WikidataQ129298656 ScholiaQ129298656MaRDI QIDQ1783640FDOQ1783640

Authors: Mariusz Meszka 

Publication date: 21 September 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.08.004

zbMATH Keywords

Hamiltonianpancyclicbipartite digraphbalancedbipancyclic

Mathematics Subject Classification ID

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

Cites Work

• On Hamiltonian bipartite graphs
• An Ore-type condition implying a digraph to be pancyclic
• A degree condition for cycles of maximum length in bipartite digraphs
• Characterizing degree-sum maximal nonhamiltonian bipartite graphs
• On the Meyniel condition for Hamiltonicity in bipartite digraphs

Cited In (5)

• Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
• Disjoint Cycles in a Digraph with Partial Degree
• Extremal digraphs on Meyniel-type condition for Hamiltonian cycles in balanced bipartite digraphs
• 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

This page was built for publication: New sufficient conditions for bipancyclicity of balanced bipartite digraphs

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