Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs (Q2725050): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Fengming Dong / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Kee L. Teo / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Michael D. Hendy / rank | |||
Normal rank |
Revision as of 16:56, 15 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