On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
type: Item
instance of: scholarly article
title: On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
zbMATH Open document ID: 1042.05047
published in: Discrete Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 2083676
zbMATH Keywords: Chromatically unique
zbMATH Keywords: \(\sigma\)-Polynomials
zbMATH Keywords: Adjoint polynomials
zbMATH Keywords: Adjointly unique
zbMATH Keywords: Minimum real roots
author: Haixing Zhao
author: Xueliang Li
author: Shenggui Zhang
author: Ru Ying Liu
MaRDI profile type: Publication
full work available at URL: j.disc.2003.06.010
OpenAlex ID: W1995205959
cites work: Q5422499
cites work: Expansions of Chromatic Polynomials and Log-Concavity
cites work: Location of Zeros of Chromatic and Related Polynomials of Graphs
cites work: On chromatic equivalence of graphs
cites work: Chromaticity of some families of dense graphs
cites work: Chromaticity of the complements of paths and cycles
cites work: The search for chromatically unique graphs
cites work: The search for chromatically unique graphs. II
cites work: \(\sigma\)-polynomials and graph coloring
cites work: Adjoint polynomials and chromatically unique graphs
cites work: Q4387894
cites work: A new method for proving chromatic uniqueness of graphs
cites work: Q3748279
cites work: Q3840587
cites work: Q4528768
DOI: 10.1016/J.DISC.2003.06.010
description: scientific article; zbMATH DE number 2083676