The following pages link to (Q5313291):
Displaying 50 items.
- Counting the number of non-equivalent vertex colorings of a graph (Q260025) (← links)
- On zeros of the characteristic polynomial of matroids of bounded tree-width (Q338570) (← links)
- On the real roots of \(\sigma\)-polynomials (Q343712) (← links)
- Algebraic integers as chromatic and domination roots (Q446327) (← links)
- Graphs whose certain polynomials have few distinct roots (Q470526) (← links)
- An abstraction of Whitney's broken circuit theorem (Q470960) (← links)
- Chromatic roots and limits of dense graphs (Q512616) (← links)
- On the absolute sum of chromatic polynomial coefficient of graphs (Q539349) (← links)
- Independence roots and independence fractals of certain graphs (Q545570) (← links)
- Exact results on Potts model partition functions in a generalized external field and weighted-set graph colorings (Q616248) (← links)
- Pairs of chromatically equivalent graphs (Q659723) (← links)
- On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs (Q670591) (← links)
- Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind (Q723786) (← links)
- On the roots of Wiener polynomials of graphs (Q724845) (← links)
- On the location of roots of graph polynomials (Q740260) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- Chromatic zeros on hierarchical lattices and equidistribution on parameter space (Q824267) (← links)
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- On planar and non-planar graphs having no chromatic zeros in the interval(1,2) (Q932643) (← links)
- A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\) (Q932684) (← links)
- Domination numbers and zeros of chromatic polynomials (Q952654) (← links)
- Weighted graph colorings (Q963274) (← links)
- Weighted-set graph colorings (Q967667) (← links)
- Series-parallel chromatic hypergraphs (Q968129) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- On the chromaticity of multi-bridge hypergraphs (Q1043804) (← links)
- On the minimum real roots of the adjoint polynomial of a graph (Q1044000) (← links)
- On graphs whose flow polynomials have real roots only (Q1658775) (← links)
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- Note on some restricted Stirling numbers of the second kind (Q1695189) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Restraints permitting the largest number of colourings (Q1786873) (← links)
- Chromaticity of complete 6-partite graphs with certain star or matching deleted. II (Q1945962) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- Recursion relations for chromatic coefficients for graphs and hypergraphs (Q2062676) (← links)
- Mean color numbers of some graphs (Q2062899) (← links)
- Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs (Q2067108) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← links)
- Novel results on partial Hosoya polynomials: an application in chemistry (Q2161874) (← links)
- The DP color function of joins and vertex-gluings of graphs (Q2166313) (← links)
- On the roots of the subtree polynomial (Q2198997) (← links)
- Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- On homotopy types of Vietoris-Rips complexes of metric gluings (Q2209749) (← links)
- On the independent domination polynomial of a graph (Q2217495) (← links)
