Skip to main navigation Skip to search Skip to main content

An O(N2) algorithm for coloring perfect planar graphs

  • Stony Brook University

Research output: Contribution to journalArticlepeer-review

6 Scopus citations
Original languageEnglish
Pages (from-to)60-68
Number of pages9
JournalJournal of Algorithms
Volume5
Issue number1
DOIs
StatePublished - Mar 1984

Fingerprint

Dive into the research topics of 'An O(N2) algorithm for coloring perfect planar graphs'. Together they form a unique fingerprint.

Cite this