On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Vertex-distinguishing edge colorings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex-distinguishing proper edge-colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3366825 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adjacent strong edge coloring of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4503707 / rank | |||
Normal rank | |||
Latest revision as of 12:02, 27 June 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
