A critically chromatic graph (Q1366769): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Classification of Symmetric Graphs with a Prime Number of Vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On uniquely 3-colorable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank | |||
Normal rank | |||
Latest revision as of 18:51, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A critically chromatic graph |
scientific article |
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
