Abstract
We prove that the edges of every even graph G∈=∈G 1∈+∈G 2 that is the join of two regular graphs G i ∈=∈(V i ,E i ) can be coloured with Δ(G) colours, whenever Δ(G)∈=∈Δ(G 2)∈+∈|V(G 1)|. The proof of this result yields a combinatorial algorithm to optimally colour the edges of this type of graphs. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
De Simone, C., & Galluccio, A. (2008). A combinatorial algorithm to optimally colour the edges of the graphs that are join of regular graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5165 LNCS, pp. 351–360). https://doi.org/10.1007/978-3-540-85097-7_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
