Cycles and paths of many lengths in bipartite digraphs
From MaRDI portal
DOI10.1016/0095-8956(90)90081-AzbMATH Open0712.05031OpenAlexW2081397477MaRDI QIDQ923098FDOQ923098
Authors: Denise Amar, Y. 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
Recommendations
Cites Work
- Title not available (Why is that?)
- On Hamiltonian bipartite graphs
- Cycles in bipartite tournaments
- Cycles and paths of many lengths in bipartite digraphs
- An Ore-type condition implying a digraph to be pancyclic
- Cycles in digraphs– a survey
- Bipartite graphs with cycles of all even lengths
- Long paths and cycles in oriented graphs
- On pancyclic digraphs
- Long Cycles in Digraphs
- Cycles of Each Length in Regular Tournaments
- Title not available (Why is that?)
Cited In (38)
- Complementary cycles in regular bipartite tournaments
- Cycles of length 0 modulo k in directed graphs
- An extremal problem resulting in many paths.
- A degree condition for cycles of maximum length in bipartite digraphs
- Subtrees of bipartite digraphs---the minimum degree condition
- Cycles and paths of many lengths in bipartite digraphs
- Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
- The structure of 2-colored best match graphs
- Complementary cycles containing a fixed arc in diregular bipartite tournaments
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- A degree sum condition for Hamiltonicity in balanced bipartite digraphs
- The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
- Longest paths and cycles in bipartite oriented graphs
- Shortest paths in iterated line digraph of a complete bipartite digraph.
- Cycles and paths in bipartite tournaments with spanning configurations
- Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs
- Hamiltonian properties and the bipartite independence number
- Multipartite tournaments: a survey
- Long cycles in bipartite tournaments
- Paths in bipartite graphs with color‐inverting involutions
- Title not available (Why is that?)
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on cycles of maximum length in bipartite digraphs
- Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
- Semicomplete Multipartite Digraphs
- Title not available (Why is that?)
- Short directed cycles in bipartite digraphs
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
- Uniqueness of cycle length distribution of certain bipartite graphs \(K_{n,r}-A\) \((|A|\leq 3)\)
- A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
- Almost given length cycles in digraphs
- Title not available (Why is that?)
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Title not available (Why is that?)
This page was built for publication: Cycles and paths of many lengths in bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923098)
