Chromatic uniqueness of the complements of certain forests

DOI10.1016/S0012-365X(96)00270-1MaRDI QIDQ1366780zbMATH OpenOpenAlexFDO

Authors Nian Zu Li, Xuewen Bao, Ru Ying Liu

Publication date 7 December 1997

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

adjoint polynomialchromatic polynomialchromatic uniquetree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Review text

A \(T\)-shape tree is a tree with the degree sequence \(\{ 1,1,1,2,2,\dots, 2,3\}\). By studying adjoint polynomials, the authors obtained the following result. There is a family \(\mathcal H\) of \(T\)-shape trees such that for each \(H \in {\mathcal H}\), if the complement of a graph \(G\) is a disjoint union of any number of copies of \(H\), then \(G\) is chromatically unique.

Recommendations

• scientific article; zbMATH DE number 528795
• scientific article; zbMATH DE number 1214963
• scientific article; zbMATH DE number 894702
• scientific article; zbMATH DE number 742643
• scientific article; zbMATH DE number 1264051
• scientific article; zbMATH DE number 1094005
• Chromaticity of the complements of D_n
• scientific article; zbMATH DE number 1563918
• Chromaticity of the complements of paths and cycles
• scientific article; zbMATH DE number 975328

Cites work

• Chromatic uniqueness of a class of graphs
• scientific article; zbMATH DE number 151783 (Why is no real title available?)
• The search for chromatically unique graphs

Cited in

(1)

• The chromaticity of the join of tree and null graph

This page was built for publication: Chromatic uniqueness of the complements of certain forests

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