On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
From MaRDI portal
Publication:4602862
DOI10.1137/16M1108959zbMath1379.05046arXiv1612.08904MaRDI QIDQ4602862
Publication date: 7 February 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.08904
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Disjoint Cycles in a Digraph with Partial Degree ⋮ A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ The quadratic cycle cover problem: special cases and efficient bounds ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ 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
Cites Work
- Unnamed Item
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Disjoint cycles in digraphs
- Bipartite graphs with every matching in a cycle
- A look at cycles containing specified elements of a graph
- Disjoint directed cycles
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- Note on Hamilton Circuits
- A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
- Cycles in digraphs– a survey
- Degree conditions for 2-factors
- Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
- Sufficient Conditions for Circuits in Graphs†
This page was built for publication: On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
