Balanced <I>k</I>-Coloring of Polyominos

Toshihiko TAKAHASHI

Balanced k-Coloring of Polyominos

Toshihiko TAKAHASHI

Full Text Views

0

Cite this

Summary :

A polyomino is a configuration composed of squares connected by sharing edges. A k-coloring of a polyomino is an assignment of k colors to the squares of the polyomino in such a way no two adjacent squares receive the same color. A k-coloring is called balanced if the difference of the number of squares in color i and that of squares in color j is at most one for any two colors i and j. In this paper, we show that any polyomino has balanced k-coloring for k3.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.3 pp.517-520

Publication Date: 1994/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on the 6th Karuizawa Workshop on Circuits and Systems)

Category: Algorithms, Data Structure and Computational Complexity

Cite this

Copy

Toshihiko TAKAHASHI, "Balanced k-Coloring of Polyominos" in IEICE TRANSACTIONS on Fundamentals, vol. E77-A, no. 3, pp. 517-520, March 1994, doi: .
Abstract: A polyomino is a configuration composed of squares connected by sharing edges. A k-coloring of a polyomino is an assignment of k colors to the squares of the polyomino in such a way no two adjacent squares receive the same color. A k-coloring is called balanced if the difference of the number of squares in color i and that of squares in color j is at most one for any two colors i and j. In this paper, we show that any polyomino has balanced k-coloring for k3.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_3_517/_p

Copy

@ARTICLE{e77-a_3_517,
author={Toshihiko TAKAHASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Balanced k-Coloring of Polyominos},
year={1994},
volume={E77-A},
number={3},
pages={517-520},
abstract={A polyomino is a configuration composed of squares connected by sharing edges. A k-coloring of a polyomino is an assignment of k colors to the squares of the polyomino in such a way no two adjacent squares receive the same color. A k-coloring is called balanced if the difference of the number of squares in color i and that of squares in color j is at most one for any two colors i and j. In this paper, we show that any polyomino has balanced k-coloring for k3.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Balanced k-Coloring of Polyominos
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 517
EP - 520
AU - Toshihiko TAKAHASHI
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1994
AB - A polyomino is a configuration composed of squares connected by sharing edges. A k-coloring of a polyomino is an assignment of k colors to the squares of the polyomino in such a way no two adjacent squares receive the same color. A k-coloring is called balanced if the difference of the number of squares in color i and that of squares in color j is at most one for any two colors i and j. In this paper, we show that any polyomino has balanced k-coloring for k3.
ER -