Pages that link to "Item:Q1112071"
From MaRDI portal
The following pages link to Matching structure and the matching lattice (Q1112071):
Displaying 50 items.
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Matching covered graphs with three removable classes (Q405203) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Face-width of Pfaffian braces and polyhex graphs on surfaces (Q490246) (← 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)
- Thin edges in braces (Q888627) (← links)
- A characterization of minimal non-Seymour graphs (Q898107) (← links)
- On Hilbert bases of cuts (Q898132) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← 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)
- The 2-matching lattice of a graph (Q1124612) (← links)
- The lattices of matroid bases and exact matroid bases (Q1176781) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- A note on the \(f\)-factor-lattice of bipartite graphs (Q1204470) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← 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)
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice (Q1850602) (← links)
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph (Q1850603) (← links)
- The cocycle lattice of binary matroids. II (Q1899432) (← links)
- On 2-extendable abelian Cayley graphs (Q1903715) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- Digraphs of directed treewidth one (Q2005715) (← links)
- Laminar tight cuts in matching covered graphs (Q2040018) (← links)
- Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- Sparse representation of vectors in lattices and semigroups (Q2118144) (← links)
- On cycle-nice claw-free graphs (Q2138970) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- Bicritical graphs without removable edges (Q2166208) (← links)
- Equivalence classes in matching covered graphs (Q2185935) (← links)
- The lattice of cycles of an undirected graph (Q2228498) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks (Q2309225) (← links)
- How to build a brick (Q2433703) (← links)
- Pfaffian orientations for a type of bipartite graph (Q2437778) (← links)
- Minimal bricks have many vertices of small degree (Q2441634) (← links)
- Minimal bricks (Q2496202) (← links)
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
- A note on the lattice of 2-matroid-intersections (Q2641310) (← links)
