Linear operators preserving properties of graphs. (English) Zbl 0696.05049

Combinatorics, graph theory, and computing, Proc. 20th Southeast Conf., Boca Raton/FL (USA) 1989, Congr. Numerantium 70, 105-112 (1990).
[For the entire collection see Zbl 0688.00002.]
An operator T on a graph G is said to be linear if it preserves unions. Various properties are proved of linear operators that preserve planarity, k colorability, k edge colorability, the chromatic number and the edge chromatic number.
Reviewer: H.N.V.Temperley


05C99 Graph theory


Zbl 0688.00002