Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992)
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: Neighbor-distinguishing k-tuple edge-colorings of graphs |
scientific article; zbMATH DE number 5648056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs |
scientific article; zbMATH DE number 5648056 |
Statements
Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (English)
0 references
15 December 2009
0 references
graph
0 references
\(k\)-tuple edge-coloring
0 references
neighbor-distinguishing
0 references
adjacent vertex-distinguishing
0 references
fractional coloring
0 references
circular coloring
0 references
0.8342812061309814
0 references
0.8321175575256348
0 references
0.8251246809959412
0 references
0.8075149655342102
0 references
0.8072718381881714
0 references
