Abstract
It is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at most 10 colours. A simple algorithm achieving a strong edge-colouring with at most 10 colours for any graph with maximum degree at most 3 is described; the algorithm is of a greedy nature and has running time linear in the number of vertices of the graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
