Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI (Q2919740)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6090536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI |
scientific article; zbMATH DE number 6090536 |
Statements
5 October 2012
0 references
vertex distinguishing total coloring
0 references
vertex distinguishing total chromatic number
0 references
triangle sequence
0 references
ladder graph
0 references
Vertex-distinguishing total coloring of ladder graphs \((n \equiv 6\pmod{8})\). VI (English)
0 references
0.8934485912322998
0 references
0.8554937243461609
0 references
0.8541060090065002
0 references
0.8425779938697815
0 references
0.839691698551178
0 references
