3-Connected planar graphs are 5-distinguishing colorable with two exceptions (Q3119067)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 3-Connected planar graphs are 5-distinguishing colorable with two exceptions |
scientific article |
Statements
3-Connected planar graphs are 5-distinguishing colorable with two exceptions (English)
0 references
7 March 2012
0 references
planar graphs
0 references
distinguishing number
0 references
distinguishing chromatic number
0 references
