The following pages link to (Q3819084):
Displaying 8 items.
- On problems and conjectures on adjointly equivalent graphs (Q556853) (← links)
- On the location of roots of independence polynomials (Q596652) (← links)
- Pairs of chromatically equivalent graphs (Q659723) (← links)
- Exact chromatic polynomials for toroidal chains of complete graphs (Q699117) (← links)
- On graphs in which any pair of colour classes but one induces a tree (Q1357722) (← links)
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (Q6038583) (← links)
- DP color functions versus chromatic polynomials (II) (Q6047960) (← links)
- Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II (Q6080166) (← links)
