Brace generation
From MaRDI portal
Publication:2781060
DOI10.1002/jgt.1029zbMath0991.05086OpenAlexW4255431924MaRDI QIDQ2781060
Publication date: 14 March 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.1029
Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (16)
Regular bipartite graphs with all 2-factors isomorphic ⋮ On Two Unsolved Problems Concerning Matching Covered Graphs ⋮ Generating bricks ⋮ Thin edges in braces ⋮ Noncommutative field theory ⋮ Minimal braces ⋮ A matching-minor monotone parameter for bipartite graphs ⋮ Generating simple near‐bipartite bricks ⋮ How to build a brick ⋮ Solving linear programs from sign patterns ⋮ Sign-solvable linear complementarity problems ⋮ Cubic bridgeless graphs and braces ⋮ Digraphs of directed treewidth one ⋮ Construction for bicritical graphs and \(k\)-extendable bipartite graphs ⋮ On the number of dissimilar pfaffian orientations of graphs ⋮ 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
Cites Work
- The complexity of computing the permanent
- Brick decompositions and the matching rank of graphs
- Sign-nonsingular matrices and even cycles in directed graphs
- Matching structure and the matching lattice
- Ear decompositions of matching covered graphs
- The two ear theorem on matching-covered graphs
- On n-extendable graphs
- Decomposition of regular matroids
- On minimal elementary bipartite graphs
- Extending matchings in graphs: A survey
- Permanents, Pfaffian orientations, and even directed circuits
- Extension of partial diagonals of matrices. I
- Even dicycles
This page was built for publication: Brace generation
