Equitable coloring in 1-planar graphs

Daniel W. Cranston, Reem Mahmoud

Research output: Contribution to journalArticlepeer-review

Abstract

For every r≥13, we show every 1-planar graph G with Δ(G)≤r has an equitable r-coloring.

Original languageEnglish (US)
Article number114286
JournalDiscrete Mathematics
Volume348
Issue number2
DOIs
StatePublished - Feb 2025

Keywords

  • 1-planar
  • Digraph
  • Equitable coloring conjecture
  • Hajnal-Szemerédi

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Equitable coloring in 1-planar graphs'. Together they form a unique fingerprint.

Cite this