Pages that link to "Item:Q1850066"
From MaRDI portal
The following pages link to Chromaticity of some families of dense graphs (Q1850066):
Displaying 14 items.
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Tutte polynomials and a stronger version of the Akiyama-Harary problem (Q497304) (← links)
- On problems and conjectures on adjointly equivalent graphs (Q556853) (← links)
- Pairs of chromatically equivalent graphs (Q659723) (← 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)
- Chromaticity of the complements of paths and cycles (Q1356659) (← links)
- Proof of a chromatic polynomial conjecture (Q1569069) (← links)
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs (Q1827719) (← links)
- The chromatic polynomial between graph \& its complement---about Akiyama and Harary's open problem (Q1906858) (← links)
- Characterization for the chromaticity of a class of the dense graphs (Q2917795) (← links)
- On chromatic equivalence of graphs (Q4148003) (← links)
- Density of Chromatic Roots in Minor-Closed Graph Families (Q4554778) (← links)
- On the chromatic coefficients of graphs with dense neighborhoods. (Q5314020) (← links)
