zbMATH — the first resource for mathematics

The chromaticity of $$s$$-bridge graphs and related graphs. (English) Zbl 0814.05036
The graph consisting of $$s$$ paths joining two vertices is called an $$s$$- bridge graph. Necessary and sufficient conditions for a 4-bridge graph to be chromatically unique are given. Some classes of graphs which are chromatically unique or chromatically equivalent to $$s$$-bridge graphs are considered too.

MSC:
 05C15 Coloring of graphs and hypergraphs
Full Text:
References:
 [1] Chao, C.Y.; Whitehead, E.G., On chromatic equivalence of graphs, (), 121-121, Springer Lecture Notes in Math. [2] Chao, C.Y.; Zhao, L.C., Chromatic polynomials of a family of graphs, Ars combin., 15, 111-129, (1983) · Zbl 0532.05027 [3] Loerinc, B., Chromatic uniqueness of the generalized θ-graph, Discrete math., 23, 313-316, (1978) · Zbl 0389.05034 [4] Teo, C.T.; Koh, K.M., The chromaticity of complete bipartite graphs with at most one edge deleted, J. graph theory, 14, 89-99, (1990) · Zbl 0712.05027 [5] Xu, Shaoji, A lemma in studying chromaticity, Ars combin., 32, 315-318, (1991) · Zbl 0753.05039 [6] Shaoji Xu, Classes of chromatically equivalent graphs and polygon trees, to appear. · Zbl 0813.05030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.