On chromatic uniqueness of two infinite families of graphs

DOI10.1002/JGT.3190170312MaRDI QIDQ4201394zbMATH OpenOpenAlexFDO

Authors F. M. Dong

Publication date 24 August 1993

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190170312

zbMATH Keywords

chromatic uniqueness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 3999955
• On the chromatic uniqueness of bipartite graphs
• On the chromatic uniqueness of certain bipartite graphs
• The chromaticity of a family of \(G_k(a,b;c,d)\) graphs

Cites work

• Chromatic uniqueness of the generalized -graph

Cited in

(9)

• On T-chromatic uniqueness of graphs
• The search for chromatically unique graphs. II
• A bibliography on chromatic polynomials
• On the structure and chromaticity of graphs in which any two colour classes induce a tree
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• scientific article; zbMATH DE number 3904611 (Why is no real title available?)
• scientific article; zbMATH DE number 4079450 (Why is no real title available?)
• Counterexamples against some families of chromatically unique graphs
• Unavoidable chromatic patterns in 2‐colorings of the complete graph

This page was built for publication: On chromatic uniqueness of two infinite families of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201394)