Disjoint directed cycles with specified lengths in directed bipartite graphs

DOI10.1016/j.disc.2020.112276zbMath1460.05097OpenAlexW3119048199MaRDI QIDQ2659188

Hong Wang, Yun Shu Gao, Qingsong Zou

Publication date: 25 March 2021

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

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

zbMATH Keywords

coveringsminimum degreevertex-disjoint directed cycles

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• Partition of a bipartite graph into cycles
• Edge disjoint placement of graphs
• On circuits in graphs
• On a conjecture on directed cycles in a directed bipartite graph
• On maximal paths and circuits of graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• Digraphs containing every possible pair of dicycles
• On the maximal number of independent circuits in a graph
• Independent directed triangles in a directed graph

This page was built for publication: Disjoint directed cycles with specified lengths in directed bipartite graphs