Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
From MaRDI portal
Publication:2359983
DOI10.1016/j.ejc.2017.04.006zbMath1365.05140arXiv1611.04245MaRDI QIDQ2359983
Publication date: 23 June 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.04245
Related Items
Unnamed Item, On P-unique hypergraphs, Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II, Zero-free intervals of chromatic polynomials of hypergraphs, More connections between the matching polynomial and the chromatic polynomial, Counting Candy Crush configurations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chromatic polynomials of some \((m,l)\)-hyperwheels
- On the location of roots of independence polynomials
- Some properties of chromatic coefficients of linear uniform hypergraphs
- The roots of the independence polynomial of a clawfree graph
- Chromatic coefficients of linear uniform hypergraphs
- A broken-circuits-theorem for hypergraphs
- The four-colour theorem
- Coloring mixed hypergraphs: theory, algorithms and applications
- Sunflower hypergraphs are chromatically unique
- Log-concavity of characteristic polynomials and the Bergman fan of matroids
- Some results on chromatic polynomials of hypergraphs
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
- Acyclic orientations of graphs
- Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Cutpoints and the chromatic polynomial
- Computing Graph Polynomials on Graphs of Bounded Clique-Width
- Hypergraph planarity and the complexity of drawing venn diagrams
- Every Planar Map is Four Colorable
- HYPERGRAPHS
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Chromatic Roots are Dense in the Whole Complex Plane
- Hypergraphs with pendant paths are not chromatically unique
- An introduction to chromatic polynomials
- Hypergraphs and Ramseyian Theorems
- Chromatic Polynomials
- Chromatic polynomials of hypergraphs