Premium
Brace generation
Author(s) -
McCuaig William
Publication year - 2001
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.1029
Subject(s) - combinatorics , bipartite graph , mathematics , brace , matching (statistics) , graph , discrete mathematics , structural engineering , statistics , engineering
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom