Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Equitable Colorings of Planar Graphs

Yi Zhang1, Hian-Poh Yap1
1 Department of Mathematics National University of Singapore 10 Kent Ridge Crescent Singapore, 119260
  • Published: 30/06/1998

Abstract

In this paper, we prove that the Equitable \(\Delta\)-Coloring Conjecture holds for planar graphs with maximum degree \(\Delta \geq 13\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Yi Zhang, Hian-Poh Yap. Equitable Colorings of Planar Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 027. 97-105. .