Brace generation
From MaRDI portal
Recommendations
Cites work
- Brick decompositions and the matching rank of graphs
- Decomposition of regular matroids
- Ear decompositions of matching covered graphs
- Even dicycles
- Extending matchings in graphs: A survey
- Extension of partial diagonals of matrices. I
- Matching structure and the matching lattice
- On minimal elementary bipartite graphs
- On n-extendable graphs
- Permanents, Pfaffian orientations, and even directed circuits
- Sign-nonsingular matrices and even cycles in directed graphs
- The complexity of computing the permanent
- The two ear theorem on matching-covered graphs
Cited in
(24)- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
- Regular bipartite graphs with all 2-factors isomorphic
- Generating bracelets with fixed content
- Digraphs of directed treewidth one
- How to build a brick
- Construction for bicritical graphs and \(k\)-extendable bipartite graphs
- Generating bricks
- Generating fixed density bracelets of arbitrary base
- On two unsolved problems concerning matching covered graphs
- On the number of dissimilar pfaffian orientations of graphs
- Cubic bridgeless graphs and braces
- Noncommutative field theory
- Minimal braces
- A matching-minor monotone parameter for bipartite graphs
- Generating simple near‐bipartite bricks
- Thin edges in cubic braces
- K₄-free planar minimal bricks with the maximum number of edges
- Minimal bricks with the maximum number of edges
- Braces of perfect matching width 2
- Independent removable edges in cubic bricks
- Thin edges in the subgraph induced by noncubic vertices of a brace
- Thin edges in braces
- Solving linear programs from sign patterns
- Sign-solvable linear complementarity problems
This page was built for publication: Brace generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781060)
