×

zbMATH — the first resource for mathematics

On resolving edge colorings in graphs. (English) Zbl 1026.05041
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.
MSC:
05C15 Coloring of graphs and hypergraphs
05C12 Distance in graphs
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
PDF BibTeX XML Cite
Full Text: DOI EuDML