Another family of chromatically unique graphs

DOI10.1007/BF01793016zbMATH Open0836.05028MaRDI QIDQ1900525FDOQ1900525

Authors: Yanyan Li 

Publication date: 29 November 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3904611
• The search for chromatically unique graphs
• scientific article; zbMATH DE number 702157
• Two classes of chromatically unique graphs
• Chromaticity of a family of \(K_ 4\) homeomorphs

zbMATH Keywords

chromatic polynomialchromatically unique graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)

Cites Work

• An introduction to chromatic polynomials
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• The search for chromatically unique graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The chromaticity of \(s\)-bridge graphs and related graphs

Cited In (9)

• A bibliography on chromatic polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counterexamples against some families of chromatically unique graphs
• Chromatic uniqueness in a family of 2-connected graphs
• Chromatic equivalence classes of certain generalized polygon trees
• New families of adjointly unique graphs
• The search for chromatically unique graphs. II

This page was built for publication: Another family of chromatically unique graphs

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