Skip to Main content Skip to Navigation
Journal articles

A note on compact and compact circular edge-colorings of graphs

Abstract : We study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models. We prove that every outerplanar bipartite graph admits a compact edge-coloring and that the decision problem of the existence of compact circular edge-coloring is NP-complete in general. Then we provide a polynomial time 1:5-approximation algorithm and pseudo-polynomial exact algorithm for compact circular coloring of odd cycles and prove that it is NP-hard to optimally color these graphs. Finally, we prove that if a path P2 is joined by an edge to an odd cycle then the problem of the existence of a compact circular coloring becomes NP-complete.
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:13:21 PM
Last modification on : Tuesday, October 19, 2021 - 11:27:27 PM
Long-term archiving on: : Thursday, July 3, 2014 - 4:36:03 PM


Files produced by the author(s)




Dariusz Dereniowski, Adam Nadolski. A note on compact and compact circular edge-colorings of graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, Vol. 10 no. 3 (3), pp.161--170. ⟨10.46298/dmtcs.431⟩. ⟨hal-00972326⟩



Record views


Files downloads