Chromatically unique multibridge graphs
From MaRDI portal
Summary: Let \(\theta (a_1,a_2,\dots ,a_k)\) denote the graph obtained by connecting two distinct vertices with \(k\) independent paths of lengths \(a_1,a_2, \dots ,a_k\) respectively. Assume that \(2\leq a_1\leq a_2\leq \cdots \leq a_k\). We prove that the graph \(\theta (a_1,a_2, \dots ,a_k)\) is chromatically unique if \(a_k < a_1+a_2\), and find examples showing that \(\theta (a_1,a_2, \dots ,a_k)\) may not be chromatically unique if \(a_k=a_1+a_2\).
Recommendations
Cited in
(9)- The chromaticity of s-bridge graphs and related graphs
- On T-chromatic uniqueness of graphs
- The chromatic uniqueness of 6-bridge graphs
- A new family of chromatically unique 6-bridge graph
- The chromaticity of a family of \(G_k(a,b;c,d)\) graphs
- Patterns in Khovanov link and chromatic graph homology
- Chromatically unique 6-bridge graph \(\theta(a,a,a,b,b,c)\)
- Chromatically unique 6-bridge graphs \(\theta(r, r, r, s, t, u)\)
- Series-parallel chromatic hypergraphs
This page was built for publication: Chromatically unique multibridge graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422157)