Equivalence of two conjectures on equitable coloring of graphs
type: Item
instance of: scholarly article
title: Equivalence of two conjectures on equitable coloring of graphs
zbMATH Open document ID: 1273.90223
author: Bor-Liang Chen
author: Ko-Wei Lih
author: Chih-Hung Yen
published in: Journal of Combinatorial Optimization
publication date: 2013-06-13T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6175246
zbMATH Keywords: equitable coloring
zbMATH Keywords: maximum coloring
zbMATH Keywords: \(r\)-equitable graph
zbMATH Keywords: maximum degree
zbMATH Keywords: independence number
Wikidata QID: Q123019136
MaRDI profile type: Publication
full work available at URL: s10878-011-9429-8
OpenAlex ID: W1976812424
cites work: Equitable coloring and the maximum degree
cites work: Chromatic coloring with a maximum color class
cites work: Equitable Coloring
cites work: Q5620621
cites work: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
DOI: 10.1007/S10878-011-9429-8
description: scientific article; zbMATH DE number 6175246