The chromaticity of \(s\)-bridge graphs and related graphs
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.
scientific article; zbMATH DE number 716468