Recursion relations for chromatic coefficients for graphs and hypergraphs
From MaRDI portal
Publication:2062676
DOI10.7151/dmgt.2248zbMath1480.05056arXiv1901.00899OpenAlexW2907735425WikidataQ126845986 ScholiaQ126845986MaRDI QIDQ2062676
Bergfinnur Durhuus, Angelo Lucia
Publication date: 3 January 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.00899
Graph polynomials (05C31) Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An abstraction of Whitney's broken circuit theorem
- The dynamical motion of the zeros of the partial sums of \(e^{z}\), and its relationship to discrepancy theory
- Correction: The zeros of the partial sums of the exponential function
- An improvement of the inclusion-exclusion principle
- A broken-circuits-theorem for hypergraphs
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- A note on a broken-cycle theorem for hypergraphs
- The zeros of the partial sums of the exponential function
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- An inductive proof of Whitney's Broken Circuit Theorem
- The Zeros of the Partial Sums of the Exponential Series
- Bijective proofs of two broken circuit theorems
- On the Zeros of the Taylor Polynomials Associated with the Exponential Function
- HYPERGRAPHS
- The Szego curve, zero distribution and weighted approximation
- Topics in Chromatic Graph Theory
- Statistical Mechanics of Lattice Systems
- On the Zeroes of the Nth Partial Sum of the Exponential Series
- A Characterization of the Exponential Series
- An introduction to chromatic polynomials
This page was built for publication: Recursion relations for chromatic coefficients for graphs and hypergraphs
