The number of shortest cycles and the chromatic uniqueness of a graph (Q3990870)
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: The number of shortest cycles and the chromatic uniqueness of a graph |
scientific article; zbMATH DE number 35902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of shortest cycles and the chromatic uniqueness of a graph |
scientific article; zbMATH DE number 35902 |
Statements
The number of shortest cycles and the chromatic uniqueness of a graph (English)
0 references
28 June 1992
0 references
shortest cycles
0 references
chromatic uniquenes
0 references
upper bound
0 references
2-connected graph
0 references
extremal graphs
0 references
