scientific article; zbMATH DE number 1982173

zbMATH Open1023.68644MaRDI QIDQ4426342FDOQ4426342

Authors: Maria I. Andreou, Sotiris E. Nikoletseas, P. G. Spirakis 

Publication date: 16 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2647/26470015.htm

Title of this publication is not available (Why is that?)

Recommendations

• Heuristic for rapidly four-coloring large planar graphs
• New graph coloring algorithms
• A bound on the chromatic number of the square of a planar graph
• An O(N2) algorithm for coloring perfect planar graphs
• Coloring the square of a planar graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15) Communication networks in operations research (90B18)

Cited In (3)

• Improved square coloring of planar graphs
• Title not available (Why is that?)
• An optimal square coloring of planar graphs

Uses Software

• LEDA

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426342)