Chromatically unique multibridge graphs
type: Item
instance of: scholarly article
title: Chromatically unique multibridge graphs
zbMATH Open document ID: 1031.05047
author: K. M. Koh
author: F. M. Dong
author: K. L. Teo
author: C. H. C. Little
author: M. D. Hendy
published in: The Electronic Journal of Combinatorics
publication date: 2004-02-05T00:00:00Z
full work available at URL: https://eudml.org/doc/123233
full work available at URL: v11i1r12.html
review text: 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\).
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 2038358
zbMATH Keywords: chromatic polynomials
zbMATH Keywords: polygon-tree
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2038358