Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6827495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable |
scientific article; zbMATH DE number 6827495 |
Statements
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (English)
0 references
19 January 2018
0 references
\((k, d)\)-coloring
0 references
Nsk3CC
0 references
reducible configuration
0 references
graph operation
0 references
bad cycles
0 references
super extension
0 references
0 references
0 references
0 references
0.95869994
0 references
0.95807076
0 references
0.9562434
0 references
0.9547471
0 references
0.9487002
0 references
0.94271505
0 references
0.94244033
0 references
0.94229186
0 references
0.94088316
0 references
