Pages that link to "Item:Q1891610"

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

Displaying 7 items.

• Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
• On the real roots of \(\sigma\)-polynomials (Q343712) (← 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)
• A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs (Q1827719) (← links)
• \(\sigma\)-polynomials (Q1877681) (← links)