A note on relaxed equitable coloring of graphs
type: Item
instance of: scholarly article
title: A note on relaxed equitable coloring of graphs
zbMATH Open document ID: 1260.05057
author: Hao Fan
author: Theodore Molla
author: Xin Zhang
author: H. A. Kierstead
author: Guizhen Liu
author: Jian-Liang Wu
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6150491
zbMATH Keywords: relaxed coloring
zbMATH Keywords: deficit coloring
zbMATH Keywords: equitable coloring
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.08.001
OpenAlex ID: W2001714541
cites work: Q5422499
cites work: Q5782525
cites work: Equitable coloring and the maximum degree
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Planar graphs are 1-relaxed, 4-choosable
cites work: Relaxed coloring of a graph
cites work: Q5620621
cites work: An Ore-type theorem on equitable coloring
cites work: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
cites work: Q3656238
cites work: A fast algorithm for equitable coloring
cites work: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
cites work: Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
cites work: Set theory. An introduction to independence proofs
cites work: Bounds for the vertex linear arboricity
cites work: Equitable Coloring
DOI: 10.1016/J.IPL.2011.08.001
description: scientific article; zbMATH DE number 6150491