Rank of maximum matchings in a graph
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- scientific article; zbMATH DE number 3499169 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- On certain polytopes associated with graphs
- On the structure of factorizable graphs
- Paths, Trees, and Flowers
Cited in
(16)- Ear-decompositions of matching-covered graphs
- Brick decompositions and the matching rank of graphs
- Matching structure and the matching lattice
- Matchings in regular graphs
- Persistency in the assignment and transportation problems
- Extending matchings in graphs: A survey
- Persistency in maximum cardinality bipartite matchings
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice
- Cubic bridgeless graphs have more than a linear number of perfect matchings
- Average connectivity and average edge-connectivity in graphs
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
- Randomly colouring graphs (a combinatorial view)
- Exponentially many perfect matchings in cubic graphs
- Basilica: new canonical decomposition in matching theory
- An improved linear bound on the number of perfect matchings in cubic graphs
This page was built for publication: Rank of maximum matchings in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922477)
