# zbMATH — the first resource for mathematics

Almost every $$K_ 4$$ homeomorph is chromatically unique. (English) Zbl 0644.05020
A $$K_ 4$$ homeomorph is a graph obtained from a complete graph with 4 vertices by subdividing its edges. In this paper sufficient conditions for a $$K_ 4$$ homeomorph to be chromatically unique are proposed.
As a consequence, it is proved that almost every $$K_ 4$$ homeomorph of order p is chromatically unique as p approaches infinity.
Reviewer: I.Tomescu

##### MSC:
 05C15 Coloring of graphs and hypergraphs