Cycles and paths of many lengths in bipartite digraphs
From MaRDI portal
Publication:923098
DOI10.1016/0095-8956(90)90081-AzbMath0712.05031OpenAlexW2081397477MaRDI QIDQ923098
Denise Amar, Yannis Manoussakis
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90081-a
Related Items (19)
A degree sum condition for Hamiltonicity in balanced bipartite digraphs ⋮ Hamiltonian paths containing a given arc, in almost regular bipartite tournaments ⋮ Complementary cycles containing a fixed arc in diregular bipartite tournaments ⋮ Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs ⋮ Hamiltonian properties and the bipartite independence number ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Long cycles in bipartite tournaments ⋮ Complementary cycles in regular bipartite tournaments ⋮ Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ A degree condition for cycles of maximum length in bipartite digraphs ⋮ Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ Subtrees of bipartite digraphs---the minimum degree condition ⋮ Cycles and paths of many lengths in bipartite digraphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ The structure of 2-colored best match graphs ⋮ Multipartite tournaments: a survey ⋮ Cycles and paths in bipartite tournaments with spanning configurations ⋮ Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments ⋮ Semicomplete Multipartite Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Cycles and paths of many lengths in bipartite digraphs
- Cycles in bipartite tournaments
- An Ore-type condition implying a digraph to be pancyclic
- On pancyclic digraphs
- On Hamiltonian bipartite graphs
- Long Cycles in Digraphs
- Cycles in digraphs– a survey
- Long paths and cycles in oriented graphs
- Bipartite graphs with cycles of all even lengths
- Cycles of Each Length in Regular Tournaments
This page was built for publication: Cycles and paths of many lengths in bipartite digraphs