A critically chromatic graph (Q1366769)
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: A critically chromatic graph |
scientific article; zbMATH DE number 1061977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A critically chromatic graph |
scientific article; zbMATH DE number 1061977 |
Statements
A critically chromatic graph (English)
0 references
22 January 1998
0 references
A graph is edge-critical \(n\)-chromatic if its chromatic number equals \(n\), i.e. \(\chi(G)=n\), and \(\chi(G-e)=n-1\) for every edge \(e\) of \(G\). In the paper an edge-critical 4-chromatic 4-connected graph on 13 vertices is constructed, which solves a problem due to Dirac.
0 references
Cayley graph
0 references
chrmatic number
0 references
connectivity
0 references
critical graph
0 references
0.8847407102584839
0 references
0.8649252653121948
0 references
0.8547285199165344
0 references
