On the theory of matching equivalent graphs and rook equivalent chessboards (Q1188070)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the theory of matching equivalent graphs and rook equivalent chessboards |
scientific article; zbMATH DE number 40034
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the theory of matching equivalent graphs and rook equivalent chessboards |
scientific article; zbMATH DE number 40034 |
Statements
On the theory of matching equivalent graphs and rook equivalent chessboards (English)
0 references
3 August 1992
0 references
Matching equivalent graphs are graphs which have the same number of \(k\)- matchings, for all values of \(k\). The authors gives many results concerning the construction of such graphs. He then applies these techniques to the construction of rook equivalent chessboards, i.e. chessboards which have the same rook polynomial.
0 references
matching equivalent graphs
0 references
rook equivalent chessboards
0 references
rook polynomials
0 references
0 references
0 references
0 references
0 references
0.86963683
0 references
0.86705905
0 references
