Brace generation
William McCuaig · Journal of Graph Theory · 2001
Abstract A brace is a connected bipartite graph with a perfect matching and at least six vertices such that for every pair of nonadjacent edges, there is a perfect matching containing the edges. We give a method for generating all braces. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 124–169, 2001