Pages that link to "Item:Q1891610"

The following pages link to \(\sigma\)-polynomials and graph coloring (Q1891610):

Displaying 22 items.

• Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
• On the real roots of \(\sigma\)-polynomials (Q343712) (← links)
• Characterization of quadratic and cubic \(\sigma\)-polynomials (Q759765) (← links)
• The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\) (Q952643) (← links)
• On the minimum real roots of the adjoint polynomial of a graph (Q1044000) (← links)
• On \(\sigma\)-polynomials (Q1111560) (← links)
• Tree counting polynomials for labelled graphs. I: Properties (Q1160141) (← links)
• On graphs having \(\sigma\)-polynomials of the same degree (Q1208359) (← links)
• Chromaticity of the complements of paths and cycles (Q1356659) (← links)
• A new method for proving chromatic uniqueness of graphs (Q1363698) (← links)
• Adjoint polynomials and chromatically unique graphs (Q1366781) (← links)
• A bibliography on chromatic polynomials (Q1366790) (← links)
• Chromaticity of chordal graphs (Q1376068) (← links)
• A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
• On \(\sigma\)-polynomials and a class of chromatically unique graphs (Q1801695) (← links)
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs (Q1827719) (← links)
• \(\sigma\)-polynomials (Q1877681) (← links)
• Binomial inequalities for chromatic, flow, and tension polynomials (Q2046434) (← links)
• Total non-negativity of some combinatorial matrices (Q2299628) (← links)
• On the Roots of σ-Polynomials (Q2811197) (← links)
• Expansions of Chromatic Polynomials and Log-Concavity (Q4018926) (← links)
• ℱ-WORM colorings of some 2-trees: partition vectors (Q5225032) (← links)