The chromaticity of \(s\)-bridge graphs and related graphs (Q1343275)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromaticity of \(s\)-bridge graphs and related graphs |
scientific article |
Statements
The chromaticity of \(s\)-bridge graphs and related graphs (English)
0 references
1 February 1995
0 references
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.
0 references
chromaticity
0 references
\(s\)-bridge graph
0 references
chromatically unique
0 references
chromatically equivalent
0 references
