A fast parallel coloring of planar graphs with five colors
type: Item
instance of: scholarly article
title: A fast parallel coloring of planar graphs with five colors
zbMATH Open document ID: 0653.68069
DOI: 10.1016/0020-0190(87)90092-5
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 4066363
zbMATH Keywords: coloring of planar graphs
zbMATH Keywords: parallel algorithms
author: Joseph (Seffi) Naor
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90092-5
OpenAlex ID: W2016216976
cites work: Every planar map is four colorable. I: Discharging
cites work: Q3708831
cites work: Coloring planar graphs in parallel
cites work: Q3917502
cites work: Q3735725
cites work: Parallel concepts in graph theory
cites work: A batching method for coloring planar graphs
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
description: scientific article; zbMATH DE number 4066363