A concise proof for total coloring subcubic graphs (Q2444906): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088677188 / rank | |||
Normal rank | |||
Revision as of 15:38, 19 March 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
