Subdivisions and chromatic roots
From MaRDI portal
Publication:1306307
DOI10.1006/JCTB.1999.1901zbMATH Open0935.05044OpenAlexW2066212640MaRDI QIDQ1306307FDOQ1306307
Authors: Jason I. Brown
Publication date: 20 December 1999
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1999.1901
Recommendations
Cites Work
- Limits of chromatic zeros of some families of maps
- Location of Zeros of Chromatic and Related Polynomials of Graphs
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- A new 5‐arc‐transitive cubic graph
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- Chromatic Polynomials
- On the roots of chromatic polynomials
- Is the four-color conjecture almost false?
- Chromatic polynomials and order ideals of monomials
- Title not available (Why is that?)
- The golden root of a chromatic polynomial
- Title not available (Why is that?)
- Recursive families of graphs
- Title not available (Why is that?)
- A zero-free interval for chromatic polynomials
- Title not available (Why is that?)
- Chromatic roots - some observations and conjectures
- Title not available (Why is that?)
Cited In (7)
- A generalization of chromatic polynomial of a graph subdivision
- The \(k\)-fractal of a simplicial complex
- Combinatorial properties of subdivision meshes
- Subdivisions and the chromatic index ofr-graphs
- Dichromatic number and forced subdivisions
- On chromatic roots of large subdivisions of graphs
- The roots of \(\sigma\)-polynomials
This page was built for publication: Subdivisions and chromatic roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306307)