Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs

DOI10.1016/j.disc.2024.114306MaRDI QIDQ6646426

Koshin Yoshida, Shuya Chiba

Publication date: 2 December 2024

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

zbMATH Keywords

degreebipartite graphsdigraphsperfect matchingsdirected cycles

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• On circuits in graphs
• Partition of a bipartite Hamiltonian graph into two cycles
• On the maximal number of independent triangles in graphs
• Packings of graphs and applications to computational complexity
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• On degree sum conditions for directed path-factors with a specified number of paths
• Disjoint directed cycles in directed graphs
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• On 2-factors of a bipartite graph
• Degree conditions for 2-factors
• On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
• Disjoint 5-cycles in a graph
• 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees
• Disjoint directed quadrilaterals in a directed graph
• Independent directed triangles in a directed graph
• Disjoint cycles covering specified vertices in bipartite graphs with partial degrees

This page was built for publication: Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs