Equitable colorings of outerplanar graphs (Q1850075): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(02)00538-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2167318613 / rank | |||
Normal rank |
Latest revision as of 12:07, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equitable colorings of outerplanar graphs |
scientific article |
Statements
Equitable colorings of outerplanar graphs (English)
0 references
2 December 2002
0 references
A proper vertex coloring of a graph \(G\) is said to be equitable if the sizes of any two color classes differ by at most 1. It was conjectured by \textit{H. P. Yap} and \textit{Y. Zhang} [Bull. Inst. Math., Acad. Sin. 25, 143-149 (1997; Zbl 0882.05054)] that every outerplanar graph with maximum degree at most \(\Delta\) admits an equitable \(k\)-coloring for every \(k \geq 1 + \Delta/2\). This conjecture is proved in this paper. There are simple examples to show that the restriction on \(k\) cannot be weakened.
0 references
equitable coloring
0 references
outerplanar graph
0 references