Two-anticoloring of planar and related graphs

Abstract : An $\textit{anticoloring}$ of a graph is a coloring of some of the vertices, such that no two adjacent vertices are colored in distinct colors. We deal with the anticoloring problem with two colors for planar graphs, and, using Lipton and Tarjan's separation algorithm, provide an algorithm with some bound on the error. In the particular cases of graphs which are strong products of two paths or two cycles, we provide an explicit optimal solution.
Type de document :
Communication dans un congrès
Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.335-342, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184223
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 13 août 2015 - 13:35:09
Dernière modification le : samedi 3 mars 2018 - 01:04:57
Document(s) archivé(s) le : samedi 14 novembre 2015 - 10:24:46

Fichier

dmAD0130.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184223, version 1

Collections

Citation

Daniel Berend, Ephraim Korach, Shira Zucker. Two-anticoloring of planar and related graphs. Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.335-342, 2005, DMTCS Proceedings. 〈hal-01184223〉

Partager

Métriques

Consultations de la notice

157

Téléchargements de fichiers

135