Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs (Q2725050): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:45, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
scientific article |
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
