Finite Characterization of the Coarsest Balanced Coloring of a Network (Q5138341)
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: Finite Characterization of the Coarsest Balanced Coloring of a Network |
scientific article; zbMATH DE number 7281776
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite Characterization of the Coarsest Balanced Coloring of a Network |
scientific article; zbMATH DE number 7281776 |
Statements
Finite Characterization of the Coarsest Balanced Coloring of a Network (English)
0 references
3 December 2020
0 references
network
0 references
coloring
0 references
balance
0 references
lattice
0 references
Leighton's theorem
0 references
universal cover
0 references
input tree
0 references
0 references
0 references
0 references
