\(\sigma\)-polynomials and graph coloring
From MaRDI portal
Publication:1891610
DOI10.1016/0095-8956(78)90015-1zbMath0845.05043OpenAlexW1968835827MaRDI QIDQ1891610
Publication date: 18 July 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(78)90015-1
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (22)
\(\sigma\)-polynomials ⋮ Chromaticity of the complements of paths and cycles ⋮ A new method for proving chromatic uniqueness of graphs ⋮ On the real roots of \(\sigma\)-polynomials ⋮ On \(\sigma\)-polynomials ⋮ Adjoint polynomials and chromatically unique graphs ⋮ A bibliography on chromatic polynomials ⋮ Chromaticity of chordal graphs ⋮ A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) ⋮ Tree counting polynomials for labelled graphs. I: Properties ⋮ The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\) ⋮ On graphs having \(\sigma\)-polynomials of the same degree ⋮ Expansions of Chromatic Polynomials and Log-Concavity ⋮ On \(\sigma\)-polynomials and a class of chromatically unique graphs ⋮ Binomial inequalities for chromatic, flow, and tension polynomials ⋮ On the Roots of σ-Polynomials ⋮ Total non-negativity of some combinatorial matrices ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Characterization of quadratic and cubic \(\sigma\)-polynomials ⋮ On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs ⋮ On the minimum real roots of the adjoint polynomial of a graph ⋮ Counting the number of non-equivalent vertex colorings of a graph
Cites Work
This page was built for publication: \(\sigma\)-polynomials and graph coloring
