The \(k\)-fractal of a simplicial complex
From MaRDI portal
Publication:1877647
DOI10.1016/j.disc.2003.12.014zbMath1113.37030MaRDI QIDQ1877647
Richard J. Nowakowski, C. A. Hickman, Jason I. Brown
Publication date: 19 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.014
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
37B99: Topological dynamics
37F50: Small divisors, rotation domains and linearization in holomorphic dynamics
28A80: Fractals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the location of roots of independence polynomials
- The iteration of cubic polynomials. I: The global topology of parameter space
- Limits of chromatic zeros of some families of maps
- Subdivisions and chromatic roots
- The iteration of cubic polynomials. II: Patterns and parapatterns
- The independence fractal of a graph.
- Roots of independence polynomials of well covered graphs
- Chromatic polynomials and order ideals of monomials
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- Non-Stanley bounds for network reliability
- Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
- Invariant sets under iteration of rational functions
- Theory of monomer-dimer systems
- Dependence polynomials
- Complex analytic dynamics on the Riemann sphere
- On the theory of the matching polynomial
- The components of a Julia set
- Roots of the Reliability Polynomials
- On the Shannon capacity of a graph
- A (<5)-Colour Theorem for Planar Graphs
- Zeros of Reliability Polynomials and f-vectors of Matroids
- On a Problem of C. E. Shannon in Graph Theory
- An introduction to chromatic polynomials
- On chromatic roots of large subdivisions of graphs
