Equitable colorings of planar graphs with maximum degree at least nine
type: Item
instance of: scholarly article
title: Equitable colorings of planar graphs with maximum degree at least nine
zbMATH Open document ID: 1237.05085
author: Kittikorn Nakprasit
published in: Discrete Mathematics
publication date: 2012-03-16T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6015219
zbMATH Keywords: equitable colorings
zbMATH Keywords: planar graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2011.11.004
OpenAlex ID: W2063653165
cites work: Equitable coloring and the maximum degree
cites work: Q4198056
cites work: Q5620621
cites work: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
cites work: Equitable colorings of outerplanar graphs
cites work: On equitable coloring of bipartite graphs
cites work: Equitable Coloring
cites work: Q4348809
cites work: Q4255998
DOI: 10.1016/J.DISC.2011.11.004
description: scientific article; zbMATH DE number 6015219