Pages that link to "Item:Q952643"

The following pages link to The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\) (Q952643):

Displaying 6 items.

• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs (Q1827719) (← links)
• The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots (Q1841927) (← links)
• On the roots of \(\sigma\)-polynomials (Q2811197) (← links)
• A sufficient and necessary condition for the chromatic equivalence of a class of graphs (Q2927156) (← links)
• (Q3641849) (← links)
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\) (Q4901472) (← links)