On resolving edge colorings in graphs (Q1415146)
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: On resolving edge colorings in graphs |
scientific article; zbMATH DE number 2012587
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On resolving edge colorings in graphs |
scientific article; zbMATH DE number 2012587 |
Statements
On resolving edge colorings in graphs (English)
0 references
3 December 2003
0 references
Summary: We study the relationships between the resolving edge chromatic number and other graphical parameters and provide bounds for the resolving edge chromatic number of a connected graph.
0 references
0 references
0 references
0.9227129
0 references
0.9218846
0 references
0 references
0.9186907
0 references
