Two-anticoloring of planar and related graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAD0130.pdf (197.15 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184223 , version 1 (13-08-2015)

Identifiers

Cite

Daniel Berend, Ephraim Korach, Shira Zucker. Two-anticoloring of planar and related graphs. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.335-342, ⟨10.46298/dmtcs.3388⟩. ⟨hal-01184223⟩

Collections

INSMI TDS-MACS
212 View
424 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More