Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices (Q1430648): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Expansions of Chromatic Polynomials and Log-Concavity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3990580 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The search for chromatically unique graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The search for chromatically unique graphs. II / rank | |||
Normal rank | |||
Latest revision as of 16:27, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices |
scientific article |
Statements
Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices (English)
0 references
27 May 2004
0 references
chromatically equivalent
0 references
chromatically unique
0 references
chromaticity
0 references
0 references
