On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge (Q1661493)
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: On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge |
scientific article; zbMATH DE number 6919666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge |
scientific article; zbMATH DE number 6919666 |
Statements
On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge (English)
0 references
16 August 2018
0 references
\(k\)-critical graph
0 references
0.7993202209472656
0 references
0.7932429909706116
0 references
0.7857542634010315
0 references
0.7842982411384583
0 references
0.7812073230743408
0 references
