Partition of a directed bipartite graph into two directed cycles

DOI10.1016/0012-365X(95)00165-SzbMath0880.05068OpenAlexW2020341293MaRDI QIDQ1126308

Hong Wang, Charles Little, Kee L. Teo

Publication date: 19 January 1998

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00165-s

zbMATH Keywords

partitioncyclesdirected bipartite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On a conjecture on directed cycles in a directed bipartite graph ⋮ The structure of 2-colored best match graphs ⋮ Oriented bipartite graphs and the Goldbach graph

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
• 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

This page was built for publication: Partition of a directed bipartite graph into two directed cycles