Pages that link to "Item:Q1112071"
From MaRDI portal
The following pages link to Matching structure and the matching lattice (Q1112071):
Displaying 17 items.
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Cubic bridgeless graphs and braces (Q503640) (← links)
- Removable ears of 1-extendable graphs (Q601904) (← links)
- The perfect matching polytope and solid bricks (Q705886) (← links)
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- A characterization of minimal non-Seymour graphs (Q898107) (← links)
- On Hilbert bases of cuts (Q898132) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- A lower bound on the number of removable ears of 1-extendable graphs (Q966053) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph (Q981678) (← links)
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes (Q1003671) (← links)
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions (Q1569057) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
