Vertex distinguishing edge- and total-colorings of Cartesian and other product graphs. (Q2864442)
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 6236441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex distinguishing edge- and total-colorings of Cartesian and other product graphs. |
scientific article; zbMATH DE number 6236441 |
Statements
6 December 2013
0 references
graph products
0 references
distinguishing edge coloring
0 references
distinguishing total coloring
0 references
Vertex distinguishing edge- and total-colorings of Cartesian and other product graphs. (English)
0 references
In the paper, notions of graph coloring in which vertices (or adjacent vertices) are distinguished by the set of colors on incident edges are considered. Upper bounds on these versions of the chromatic numbers are obtained for Cartesian products of graphs. These bounds are tight for generalized (Cartesian) hypercubes.
0 references
0.873570442199707
0 references
0.8607050180435181
0 references
0.8512781858444214
0 references
0.8331018686294556
0 references
0.8307666182518005
0 references
