Some problems on chromatic polynomials
type: Item
instance of: scholarly article
title: Some problems on chromatic polynomials
zbMATH Open document ID: 0879.05033
DOI: 10.1016/S0012-365X(96)00266-X
published in: Discrete Mathematics
publication date: 1998-01-12T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1061980
zbMATH Keywords: unsolved problems
zbMATH Keywords: chromatic polynomials
author: Gek L. Chia
MaRDI profile type: Publication
cites work: On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
cites work: A new 5‐arc‐transitive cubic graph
cites work: On maximally saturated graphs
cites work: On chromatic equivalence of graphs
cites work: A note on chromatic uniqueness of graphs
cites work: Q3824333
cites work: On the join of graphs and chromatic uniqueness
cites work: Q5289580
cites work: Q3974300
cites work: Chromatic polynomials of triangulated graphs
cites work: Q3980548
cites work: Q3682504
cites work: Q3901538
cites work: Parallel concepts in graph theory
cites work: Two classes of chromatically unique graphs
cites work: The search for chromatically unique graphs
cites work: Q4031916
cites work: Q4381150
cites work: Chromatic polynomials for regular graphs and modified wheels
cites work: An introduction to chromatic polynomials
cites work: Q3832608
cites work: Q3792702
cites work: The chromaticity of complete bipartite graphs with at most one edge deleted
cites work: Chromaticity of triangulated graphs
cites work: On the chromaticity of certain subgraphs of a q-tree
cites work: Cutpoints and the chromatic polynomial
cites work: Q4128619
cites work: Q3775576
full work available at URL: s0012-365x(96)00266-x
OpenAlex ID: W2019441468
description: scientific article; zbMATH DE number 1061980