\input zb-basic
\input zb-ioport
\iteman{io-port 05064175}
\itemau{Montellano-Ballesteros, Juan Jos\'e}
\itemti{An anti-Ramsey theorem on edge-cuts.}
\itemso{Discuss. Math., Graph Theory 26, No. 1, 19-21 (2006).}
\itemab
Author's abstract: Let $G=(V(G),E(G))$ be a connected multigraph and let $h(G)$ be the minimum integer $k$ such that for every edge-colouring of $G$, using exactly $k$ colours, there is at least one edge-cut of $G$ all of whose edges receive different colours. In this note it is proved that if $G$ has at least 2 vertices and has no bridges, then $h(G)=\vert E(G)\vert -\vert V(G)\vert +2$.
\itemrv{Lorenzo Traldi (Easton)}
\itemcc{}
\itemut{totally multicoloured; connected multigraph}
\itemli{doi:10.7151/dmgt.1297}
\end