A concise proof for total coloring subcubic graphs (Q2444906): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Colour Numbers of Complete Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the total coloring of certain graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Total Chromatic Number of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Total Colourings of Graphs / rank | |||
Normal rank |
Latest revision as of 15:17, 7 July 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