Pages that link to "Item:Q1366781"

The following pages link to Adjoint polynomials and chromatically unique graphs (Q1366781):

Displaying 9 items.

• On problems and conjectures on adjointly equivalent graphs (Q556853) (← links)
• A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\) (Q932684) (← 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)
• The search for chromatically unique graphs. II (Q1366778) (← links)
• A bibliography on chromatic polynomials (Q1366790) (← links)
• The roots of \(\sigma\)-polynomials (Q1413709) (← links)
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs (Q1827719) (← links)
• On the Roots of σ-Polynomials (Q2811197) (← links)