\((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567)
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: ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles |
scientific article; zbMATH DE number 6018485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles |
scientific article; zbMATH DE number 6018485 |
Statements
\((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (English)
0 references
27 March 2012
0 references
combinatorial problems
0 references
plane graph
0 references
total coloring
0 references
maximum degree
0 references
0 references
0 references
0 references
0 references
0.9083212018013
0 references
0.8955343961715698
0 references
0.886239767074585
0 references
0.8860915899276733
0 references
