Another family of chromatically unique graphs
type: Item
instance of: scholarly article
title: Another family of chromatically unique graphs
zbMATH Open document ID: 0836.05028
DOI: 10.1007/BF01793016
author: Yanyan Li
published in: Graphs and Combinatorics
publication date: 1995-11-29T00:00:00Z
review text: A graph \(G\) is chromatically unique if any graph that has the same chromatic polynomial as \(G\) is isomorphic to \(G\). There are several classes of graphs that are known to be chromatically unique. In this paper the author presents a construction that provides a new family of chromatically unique graphs.
reviewed by: Marietjie Frick
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 811350
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: chromatically unique graphs
MaRDI profile type: Publication
cites work: Q3313882
cites work: Chromatic uniqueness of the generalized \(\Theta\)-graph
cites work: The search for chromatically unique graphs
cites work: Q3728929
cites work: An introduction to chromatic polynomials
cites work: The chromaticity of \(s\)-bridge graphs and related graphs
description: scientific article; zbMATH DE number 811350