A concise proof for total coloring subcubic graphs (Q2444906): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:08, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A concise proof for total coloring subcubic graphs |
scientific article |
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
