On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105)
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: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with (G) = 3 |
scientific article; zbMATH DE number 5211649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) |
scientific article; zbMATH DE number 5211649 |
Statements
On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (English)
0 references
14 November 2007
0 references
adjacent vertex-distinguishing total coloring
0 references
adjacent vertex-distinguishing total chromatic number
0 references
subdivision vertex
0 references
subdivision graph
0 references
0.960203230381012
0 references
0.9305371046066284
0 references
0.9217217564582824
0 references
0.9189432859420776
0 references
0.912607491016388
0 references
