A note on compact and compact circular edge-colorings of graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2008

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

Résumé

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.
Fichier principal
Vignette du fichier
526-3736-1-PB.pdf (128.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00972326 , version 1 (03-04-2014)

Identifiants

Citer

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

Collections

TDS-MACS
64 Consultations
949 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More