scientific article; zbMATH DE number 2199828
From MaRDI portal
Publication:5313291
Recommendations
Cited in
(only showing first 100 items - show all)- From a zoo to a zoology: Towards a general theory of graph polynomials
- An extension of the bivariate chromatic polynomial
- On the chromaticity of multi-bridge hypergraphs
- On the minimum real roots of the adjoint polynomial of a graph
- Some problems on chromatic polynomials
- Divisibility of certain coefficients of the chromatic polynomials.
- On graphs whose flow polynomials have real roots only
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
- Note on some restricted Stirling numbers of the second kind
- Maximizing the number of x-colorings of 4-chromatic graphs
- Extremal colorings and independent sets
- Restraints permitting the largest number of colourings
- Chromaticity of complete 6-partite graphs with certain star or matching deleted. II
- Zero-free intervals of chromatic polynomials of hypergraphs
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- Mean color numbers of some graphs
- Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
- DP color functions versus chromatic polynomials
- Novel results on partial Hosoya polynomials: an application in chemistry
- The DP color function of joins and vertex-gluings of graphs
- On the roots of the subtree polynomial
- Graph measures with high discrimination power revisited: a random polynomial approach
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- On homotopy types of Vietoris-Rips complexes of metric gluings
- On the independent domination polynomial of a graph
- Circular automata synchronize with high probability
- Independence equivalence classes of cycles
- A logician's view of graph polynomials
- On roots of Wiener polynomials of trees
- On Garlands in \(\chi\)-uniquely colorable graphs
- About chromatic uniqueness of some complete tripartite graphs
- The maximum number of colorings of graphs of given order and size: a survey
- Monochromatic subgraphs in randomly colored graphons
- Maximum number of colourings: 5-chromatic case
- New bounds for chromatic polynomials and chromatic roots
- Extremal bicyclic 3-chromatic graphs
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- On sequences of polynomials arising from graph invariants
- A proof of Tomescu's graph coloring conjecture
- On chromatic uniqueness of certain 5-partite graphs
- A note on the real part of complex chromatic roots
- A maximal zero-free interval for chromatic polynomials of bipartite planar graphs
- Chromatic polynomials of mixed hypercycles
- A note on a broken-cycle theorem for hypergraphs
- The chromatic equivalence class of \(K_{1, n, n + 2}\)
- Counting the number of non-equivalent vertex colorings of a graph
- Polynomials with real zeros via special polynomials
- On the zeros of the partial Hosoya polynomial of graphs
- Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence
- Using thresholds to compute chromatic polynomials.
- Chromatic polynomials
- On total edge fixed geodomination sets and polynomials of paths
- Chromatically equivalent class of certain graphs with integral-root polynomials
- The 3-connectivity of a graph and the multiplicity of zero ``2 of its chromatic polynomial
- A new family of chromatically unique 6-bridge graph
- Cutpoints and the chromatic polynomial
- On zeros of the characteristic polynomial of matroids of bounded tree-width
- On the real roots of \(\sigma\)-polynomials
- Complexity of the Bollobás-Riordan Polynomial
- scientific article; zbMATH DE number 4091530 (Why is no real title available?)
- Expansions of Chromatic Polynomials and Log-Concavity
- Algebraic integers as chromatic and domination roots
- scientific article; zbMATH DE number 1779834 (Why is no real title available?)
- An introduction to the k-defect polynomials
- Patterns in Khovanov link and chromatic graph homology
- Graphs whose certain polynomials have few distinct roots
- An abstraction of Whitney's broken circuit theorem
- Problems on chromatic polynomials of hypergraphs
- Chromatic polynomials of \(K_m+P_n\), \(K_m+C_n\) and \(G\circ H\)
- Chromatically unique 6-bridge graph \(\theta(a,a,a,b,b,c)\)
- Note on chromatic polynomials of the threshold graphs
- scientific article; zbMATH DE number 7471007 (Why is no real title available?)
- Integral-root polynomials and chromatic uniqueness of graphs
- Extremal Khovanov homology and the girth of a knot
- Chromatic uniqueness of zero-divisor graphs
- On the vertex covering sets and vertex cover polynomials of square of ladder graph
- Acyclic polynomials of graphs
- Chromatically unique 6-bridge graphs \(\theta(r, r, r, s, t, u)\)
- Partial-dual polynomials and signed intersection graphs
- Vietoris-Rips and Čech complexes of metric gluings
- Chromatic roots and limits of dense graphs
- Domination polynomial of clique cover product of graphs
- On some parameters related to fixing sets in graphs
- q-plane zeros of the Potts partition function on diamond hierarchical graphs
- On chromatic uniqueness of some complete tripartite graphs
- Bipartite graphs as polynomials and polynomials as bipartite graphs
- Chromatic graph theory
- Independence equivalence classes of paths and cycles
- Limit theorems for monochromatic stars
- The Second-Moment Phenomenon for Monochromatic Subgraphs
- A Most General Edge Elimination Polynomial
- The Domination Equivalence Classes of Paths
- Short certificates for chromatic equivalence
- On the absolute sum of chromatic polynomial coefficient of graphs
- Linear Recurrence Relations for Graph Polynomials
- Independence roots and independence fractals of certain graphs
- Foundations of the chromatic polynomial
- An improved lower bound of P(G,L)-P(G,k) for k-assignments L
- Upper bounds on the average number of colors in the non-equivalent colorings of a graph
- Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313291)
