A note on relaxed equitable coloring of graphs

Hao Fan, Henry Kierstead, Guizhen Liu, Theodore Molla, Jian Liang Wu, Xin Zhang

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In this note we introduce the concept of equitable d-relaxed coloring. We prove that each graph with maximum degree at most r admits an equitable 1-relaxed r-coloring and provide a polynomial-time algorithm for constructing such a coloring.

Original languageEnglish (US)
Pages (from-to)1062-1066
Number of pages5
JournalInformation Processing Letters
Volume111
Issue number21-22
DOIs
StatePublished - Dec 15 2011

Fingerprint

Equitable Coloring
Coloring
Colouring
Graph in graph theory
Maximum Degree
Polynomial-time Algorithm
Polynomials

Keywords

  • Deficit coloring
  • Equitable coloring
  • Graph algorithms
  • Relaxed coloring

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Signal Processing
  • Theoretical Computer Science

Cite this

A note on relaxed equitable coloring of graphs. / Fan, Hao; Kierstead, Henry; Liu, Guizhen; Molla, Theodore; Wu, Jian Liang; Zhang, Xin.

In: Information Processing Letters, Vol. 111, No. 21-22, 15.12.2011, p. 1062-1066.

Research output: Contribution to journalArticle

Fan, H, Kierstead, H, Liu, G, Molla, T, Wu, JL & Zhang, X 2011, 'A note on relaxed equitable coloring of graphs', Information Processing Letters, vol. 111, no. 21-22, pp. 1062-1066. https://doi.org/10.1016/j.ipl.2011.08.001
Fan, Hao ; Kierstead, Henry ; Liu, Guizhen ; Molla, Theodore ; Wu, Jian Liang ; Zhang, Xin. / A note on relaxed equitable coloring of graphs. In: Information Processing Letters. 2011 ; Vol. 111, No. 21-22. pp. 1062-1066.
@article{7994a59b29cd49e7bf085f89635cf53f,
title = "A note on relaxed equitable coloring of graphs",
abstract = "In this note we introduce the concept of equitable d-relaxed coloring. We prove that each graph with maximum degree at most r admits an equitable 1-relaxed r-coloring and provide a polynomial-time algorithm for constructing such a coloring.",
keywords = "Deficit coloring, Equitable coloring, Graph algorithms, Relaxed coloring",
author = "Hao Fan and Henry Kierstead and Guizhen Liu and Theodore Molla and Wu, {Jian Liang} and Xin Zhang",
year = "2011",
month = "12",
day = "15",
doi = "10.1016/j.ipl.2011.08.001",
language = "English (US)",
volume = "111",
pages = "1062--1066",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "21-22",

}

TY - JOUR

T1 - A note on relaxed equitable coloring of graphs

AU - Fan, Hao

AU - Kierstead, Henry

AU - Liu, Guizhen

AU - Molla, Theodore

AU - Wu, Jian Liang

AU - Zhang, Xin

PY - 2011/12/15

Y1 - 2011/12/15

N2 - In this note we introduce the concept of equitable d-relaxed coloring. We prove that each graph with maximum degree at most r admits an equitable 1-relaxed r-coloring and provide a polynomial-time algorithm for constructing such a coloring.

AB - In this note we introduce the concept of equitable d-relaxed coloring. We prove that each graph with maximum degree at most r admits an equitable 1-relaxed r-coloring and provide a polynomial-time algorithm for constructing such a coloring.

KW - Deficit coloring

KW - Equitable coloring

KW - Graph algorithms

KW - Relaxed coloring

UR - http://www.scopus.com/inward/record.url?scp=80052167928&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052167928&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2011.08.001

DO - 10.1016/j.ipl.2011.08.001

M3 - Article

AN - SCOPUS:80052167928

VL - 111

SP - 1062

EP - 1066

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 21-22

ER -