scientific article; zbMATH DE number 2192169
By \(\chi_{re}(G)\) we mean the resolving edge chromatic number of a connected graph \(G\). The following upper bounds are proved. If \(G\) is of size \(m\geq 3\) and diameter \(d\), then \(\chi_{re}(G)\leq m-d+3\), where \(\chi_{re}(G)=m-d+3\) if and only if \(G\) is a path of size \(m\geq 3\). If \(G\) is of size \(m\) and girth \(g\), where \(m\geq g\geq 3\), then \[ \chi_{re}(G) \leq\begin{cases} m-g+3 &\text{ if }g\text{ is odd},\\ m-g+4 &\text{ if }g\text{ is even}.\end{cases} \] Moreover, if \(g\) is even and \(G\) is not an even cycle, then \(\chi_{re}(G)\leq m-g+2\). All nontrivial connected graphs of size \(m\) with resolving edge chromatic number 3 or \(m\) are characterized. It is shown that for each pair \(k,m\) of integers with \(3\leq k\leq m\), there exists a graph \(G\) of size \(m\) with \(\chi_{re}(G)=k\). Resolving edge chromatic numbers of complete graphs are studied too.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463545)
