Some problems on chromatic polynomials

DOI10.1016/S0012-365X(96)00266-XzbMath0879.05033OpenAlexW2019441468MaRDI QIDQ1366774

Gek Ling Chia

Publication date: 12 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00266-x

zbMATH Keywords

unsolved problemschromatic polynomials

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS ⋮ INDUCED CYCLE POLYNOMIAL OF A GRAPH ⋮ Chromatic uniqueness of atoms in lattices of complete multipartite graphs

Cites Work

• The search for chromatically unique graphs
• Two classes of chromatically unique graphs
• Chromatic polynomials for regular graphs and modified wheels
• On the number of Latin rectangles and chromatic polynomial of L(K//(r,s))
• On maximally saturated graphs
• Parallel concepts in graph theory
• Cutpoints and the chromatic polynomial
• On the chromaticity of certain subgraphs of a q-tree
• The chromaticity of complete bipartite graphs with at most one edge deleted
• Chromaticity of triangulated graphs
• On chromatic equivalence of graphs
• On the join of graphs and chromatic uniqueness
• A note on chromatic uniqueness of graphs
• An introduction to chromatic polynomials
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some problems on chromatic polynomials