On a conjecture on directed cycles in a directed bipartite graph

DOI10.1007/BF03353004zbMath0938.05037WikidataQ123274064 ScholiaQ123274064MaRDI QIDQ1376065

Charles Little, Hong Wang, Kee L. Teo

Publication date: 21 June 2000

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

zbMATH Keywords

directed bipartite graph

Mathematics Subject Classification ID

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

Related Items

Disjoint directed cycles with specified lengths in directed bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Partition of a bipartite graph into cycles
• On circuits in graphs
• Partition of a bipartite Hamiltonian graph into two cycles
• Partition of a directed bipartite graph into two directed cycles
• Covering the vertices of a digraph by cycles of prescribed length
• A method in graph theory
• On the maximal number of independent circuits in a graph