A concise proof for total coloring subcubic graphs (Q2444906)
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 concise proof for total coloring subcubic graphs |
scientific article; zbMATH DE number 6282959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A concise proof for total coloring subcubic graphs |
scientific article; zbMATH DE number 6282959 |
Statements
A concise proof for total coloring subcubic graphs (English)
0 references
11 April 2014
0 references
total coloring
0 references
total chromatic number
0 references
subcubic graphs
0 references
cubic graphs
0 references
3-regular graphs
0 references
graph algorithms
0 references
0.8596961498260498
0 references
0.8545445799827576
0 references
0.8434746265411377
0 references
0.8379325866699219
0 references
0.8359695672988892
0 references
