Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs (Q2725050): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.1003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4235662368 / rank | |||
Normal rank | |||
Latest revision as of 19:44, 19 March 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
