Pages that link to "Item:Q1363698"
From MaRDI portal
The following pages link to A new method for proving chromatic uniqueness of graphs (Q1363698):
Displaying 7 items.
- On problems and conjectures on adjointly equivalent graphs (Q556853) (← links)
- On chromatic polynomials of some kinds of graphs (Q705078) (← 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 the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs (Q1827719) (← links)
- One more remark on the adjoint polynomial (Q2400981) (← links)
- Harary polynomials (Q5056203) (← links)
