Domination numbers and zeros of chromatic polynomials
From MaRDI portal
Publication:952654
DOI10.1016/J.DISC.2007.04.045zbMath1187.05037OpenAlexW2091487375MaRDI QIDQ952654
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.045
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Graphs with chromatic roots in the interval \((1,2)\)
- Chromatic roots and Hamiltonian paths
- A maximal zero-free interval for chromatic polynomials of bipartite planar graphs
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- An introduction to chromatic polynomials
This page was built for publication: Domination numbers and zeros of chromatic polynomials