On the chromatic equivalence class of a family of graphs
type: Item
instance of: scholarly article
title: On the chromatic equivalence class of a family of graphs
zbMATH Open document ID: 0869.05031
DOI: 10.1016/0012-365X(95)00320-V
published in: Discrete Mathematics
publication date: 1997-07-07T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1019038
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: chromatically equivalent
zbMATH Keywords: path
zbMATH Keywords: chromatic equivalence class
author: Gek L. Chia
MaRDI profile type: Publication
cites work: Chromatically unique graphs
cites work: The chromatic uniqueness of certain broken wheels
cites work: The chromaticity of certain graphs with five triangles
cites work: An introduction to chromatic polynomials
full work available at URL: 0012-365x(95)00320-v
OpenAlex ID: W2038914268
Recommended article: On the chromatic equivalence class of graphs
Recommended article: Q3137583
Recommended article: Q3818334
Recommended article: On chromatic equivalence of graphs
Recommended article: Q3475282
Recommended article: Q4604345
Recommended article: Classes of chromatically unique or equivalent graphs
Recommended article: Q5381757
Recommended article: Q3366862
Recommended article: A sufficient and necessary condition for the chromatic equivalence of a class of graphs
description: scientific article; zbMATH DE number 1019038