Exponentially many Z5-colorings in simple planar graphs

Rikke Langhede, Carsten Thomassen

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

Every planar simple graph with n vertices has at 2n/9 Zleast -colorings.
Original languageEnglish
JournalDiscrete Mathematics
Volume344
Issue number9
Number of pages22
ISSN0012-365X
DOIs
Publication statusPublished - 2021

Keywords

  • Group coloring
  • List coloring
  • Group connectivity

Fingerprint

Dive into the research topics of 'Exponentially many <b>Z</b><sub>5</sub>-colorings in simple planar graphs'. Together they form a unique fingerprint.

Cite this