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
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the connection between the chromatic number of a graph and the number of cycles covering a vertex or an edge |
scientific article |
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
