Unions of perfect matchings in r-graphs
From MaRDI portal
Publication:6172292
Recommendations
Cites work
- scientific article; zbMATH DE number 5130820 (Why is no real title available?)
- An upper bound for the excessive index of an \(r\)-graph
- Blocking and anti-blocking pairs of polyhedra
- Covering a cubic graph with perfect matchings
- Maximum matching and a polyhedron with 0,1-vertices
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- The Factorization of Linear Graphs
- The equivalence of two conjectures of Berge and Fulkerson
- Unions of 1-factors in \(r\)-graphs and overfull graphs
Cited in
(6)- Rotation $r$-graphs
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- Unions of 1-factors in \(r\)-graphs and overfull graphs
- An upper bound for the excessive index of an \(r\)-graph
- scientific article; zbMATH DE number 5130820 (Why is no real title available?)
- Corrigendum to: ``Unions of 1-factors in \(r\)-graphs and overfull graphs
This page was built for publication: Unions of perfect matchings in \(r\)-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172292)