Cited in
(55)- Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
- A note on a broken-cycle theorem for hypergraphs
- Characteristic vertices of trees*
- Counting independent sets in graphs of hyperplane arrangements
- Chromatic polynomials and broken cycles
- A new method for enumerating independent sets of a fixed size in general graphs
- Symmetric functions in noncommuting variables
- Counting flows of b-compatible graphs
- Characteristic vertices of trees*
- Maximizing \(H\)-colorings of a regular graph
- A Combinatorial Model for Series-Parallel Networks
- The inclusion-exclusion principle
- Asymptotic behavior of spanning forests and connected spanning subgraphs on two-dimensional lattices
- The Broken-Circuit Complex
- A survey of some network reliability analysis and synthesis results
- Increasing spanning forests in graphs and simplicial complexes
- Chromatic symmetric function of graphs from Borcherds algebras
- Labeling regions in deformations of graphical arrangements
- GlobaL analysis of the deiete-contract recursion for graphs and matroids
- A broken circuit model for chromatic homology theories
- Nowhere-harmonic colorings of graphs
- The topology of the external activity complex of a matroid
- On the homogenized linial arrangement: intersection lattice and Genocchi numbers
- Irregularity indices for line graph of Dutch windmill graph
- Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
- Graph polynomials and local graph operations
- Generalised chromatic polynomials of graphs from heaps of pieces
- A signed graph analogue of acyclic orientation polynomials and the sink theorem
- Chromatic polynomials and logarithmic concavity
- Flow polynomials of a signed graph
- Linked-cluster expansion of the graph-vertex coloration problem
- Non-broken circuits of reflection groups and factorization in \(D_ n\)
- On a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomials
- Brun's inequality for a geometric lattice
- Some Alternate Characterizations of Reliability Domination
- Evaluations of Tutte polynomials of regular graphs
- One-element extensions of hyperplane arrangements
- Monomial bases for broken circuit complexes
- Whitney twins, Whitney duals, and operadic partition posets
- A broken cycle theorem for the restrained chromatic function
- Multi-virtual knot theory
- On the zero-free region for the chromatic polynomial of graphs with maximum degree and girth g
- k-adjoint of hyperplane arrangements
- Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions
- Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
- A Hodge decomposition interpretation for the coefficients of the chromatic polynomial
- Lagrangian geometry of matroids
- Potts model and graph theory.
- On the broken-circuit complex of graphs
- The cycle polynomial of a permutation group
- A Gröbner basis for the graph of the reciprocal plane
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- The Chromatic Polynomial of the Truncated Icosahedron
- On the computational complexity of the Jones and Tutte polynomials
- Linear bounds on characteristic polynomials of matroids
This page was built for publication: A logical expansion in mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4482723)
