Exponentially many Z5-colorings in simple planar graphs

Rikke Langhede; Carsten Thomassen

doi:10.1016/j.disc.2021.112474

Exponentially many Z₅-colorings in simple planar graphs

Rikke Langhede, Carsten Thomassen

Department of Applied Mathematics and Computer Science

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

Every planar simple graph with n vertices has at 2^n/9Z₅least -colorings.

Original language	English
Journal	Discrete Mathematics
Volume	344
Issue number	9
Number of pages	22
ISSN	0012-365X
DOIs	https://doi.org/10.1016/j.disc.2021.112474
Publication status	Published - 2021

Keywords

Group coloring
List coloring
Group connectivity

Access to Document

10.1016/j.disc.2021.112474

OpenUrl availability

Full text

Embargoed Document

Fulltext
Accepted author manuscript, 6.98 MB
Licence: CC BY-NC-ND
Embargo ends: 04/06/2023

Cite this

@article{4727c2c103044219a7bea60f47a331c6,

title = "Exponentially many Z5-colorings in simple planar graphs",

abstract = "Every planar simple graph with n vertices has at 2n/9 Z5 least -colorings.",

keywords = "Group coloring, List coloring, Group connectivity",

author = "Rikke Langhede and Carsten Thomassen",

year = "2021",

doi = "10.1016/j.disc.2021.112474",

language = "English",

volume = "344",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "9",

}

TY - JOUR

T1 - Exponentially many Z5-colorings in simple planar graphs

AU - Langhede, Rikke

AU - Thomassen, Carsten

PY - 2021

Y1 - 2021

N2 - Every planar simple graph with n vertices has at 2n/9 Z5 least -colorings.

AB - Every planar simple graph with n vertices has at 2n/9 Z5 least -colorings.

KW - Group coloring

KW - List coloring

KW - Group connectivity

U2 - 10.1016/j.disc.2021.112474

DO - 10.1016/j.disc.2021.112474

M3 - Journal article

SN - 0012-365X

VL - 344

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 9

ER -