On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q259664 |
Changed an Item |
||
| Property / author | |||
| Property / author: Hai Ying Wang / rank | |||
Normal rank | |||
Revision as of 07:57, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) |
scientific article |
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
