A new method for proving chromatic uniqueness of graphs

DOI10.1016/S0012-365X(96)00078-7zbMATH Open0881.05046OpenAlexW1974936586MaRDI QIDQ1363698FDOQ1363698

Authors Ru Ying Liu, Lianchang Zhao 

Publication date 8 September 1997

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic polynomialchromatic uniquenesschromatically unique graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 742643
• A note on chromatic uniqueness of graphs
• scientific article; zbMATH DE number 4193701
• scientific article; zbMATH DE number 4099332
• scientific article; zbMATH DE number 4035863
• The search for chromatically unique graphs
• Two new classes of chromatically unique graphs
• A new method of proving theorems on chromatic index
• Uniquely \(n\)-colorable and chromatically equivalent graphs
• On the chromatic uniqueness of certain bipartite graphs

Cites Work

• scientific article; zbMATH DE number 151783 (Why is no real title available?)
• scientific article; zbMATH DE number 1214963 (Why is no real title available?)
• scientific article; zbMATH DE number 1153017 (Why is no real title available?)
• An introduction to chromatic polynomials
• Graph theory
• On chromatic equivalence of graphs
• The search for chromatically unique graphs
• Two new classes of chromatically unique graphs
• \(\sigma\)-polynomials and graph coloring

Cited In (13)

• The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)
• A new method of proving theorems on chromatic index
• New proofs of the uniqueness of extremal noneven digraphs
• Title not available (Why is no real title available?)
• Harary polynomials
• On problems and conjectures on adjointly equivalent graphs
• On the minimum real roots of the adjoint polynomial of a graph
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• One more remark on the adjoint polynomial
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Two new classes of chromatically unique graphs
• On chromatic polynomials of some kinds of graphs

This page was built for publication: A new method for proving chromatic uniqueness of graphs

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