Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs (Q2725050)
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: Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
scientific article; zbMATH DE number 1618677
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
scientific article; zbMATH DE number 1618677 |
Statements
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs (English)
0 references
30 June 2002
0 references
\(k\)-independent partitions
0 references
complete bipartite graph
0 references
chromatic equivalence class
0 references
chromatically unique
0 references
