Domination numbers and zeros of chromatic polynomials
From MaRDI portal
Publication:952654
DOI10.1016/J.DISC.2007.04.045zbMATH Open1187.05037OpenAlexW2091487375MaRDI QIDQ952654FDOQ952654
Authors: F. M. Dong, K. M. Koh
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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Chromatic roots and Hamiltonian paths
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Title not available (Why is that?)
- An introduction to chromatic polynomials
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- Title not available (Why is that?)
- Graphs with chromatic roots in the interval \((1,2)\)
- A maximal zero-free interval for chromatic polynomials of bipartite planar graphs
Cited In (5)
- Chromatic zeros on hierarchical lattices and equidistribution on parameter space
- A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
- Algebraic integers as chromatic and domination roots
- CHROMATIC POLYNOMIALS AND CHROMATICITY OF ZERO-DIVISOR GRAPHS II
- The largest real zero of the chromatic polynomial
This page was built for publication: Domination numbers and zeros of chromatic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952654)