The following pages link to Chromatic Polynomials (Q5839327):
Displaying 50 items.
- The number of colorings of planar graphs with no separating triangles (Q345111) (← links)
- Analysis approach to finite monoids (Q395219) (← links)
- Chromatic bounds on orbital chromatic roots (Q463065) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- A generalization of chromatic polynomial of a graph subdivision (Q690546) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Chromatic zeros on hierarchical lattices and equidistribution on parameter space (Q824267) (← links)
- The number of \(k\)-colorings of a graph on a fixed surface (Q856865) (← links)
- A zero-free interval for flow polynomials of cubic graphs (Q858684) (← links)
- Exponentially many 5-list-colorings of planar graphs (Q885292) (← links)
- Two classes of chromatically unique graphs (Q911611) (← links)
- On planar and non-planar graphs having no chromatic zeros in the interval(1,2) (Q932643) (← links)
- A survey of the asymptotic behaviour of maps (Q1057284) (← links)
- Limits of chromatic zeros of some families of maps (Q1139058) (← links)
- On the Birkhoff-Lewis equations (Q1182958) (← links)
- A new invariant of plane bipartite cubic graphs (Q1197024) (← links)
- An inequality for chromatic polynomials (Q1197039) (← links)
- A zero-free interval for chromatic polynomials (Q1197040) (← links)
- Is the four-color conjecture almost false? (Q1227748) (← links)
- Geometric coloring theory (Q1239165) (← links)
- A systematic approach to the determination of reducible configurations in the four-color conjecture (Q1254328) (← links)
- On the roots of chromatic polynomials (Q1272480) (← links)
- Catalan, Motzkin, and Riordan numbers (Q1300967) (← links)
- Subdivisions and chromatic roots (Q1306307) (← links)
- Classes of chromatically unique or equivalent graphs (Q1309443) (← links)
- The largest real zero of the chromatic polynomial (Q1366787) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Combinatorial map theory (Q1394355) (← links)
- The matrix of chromatic joins and the Temperley-Lieb algebra. (Q1410733) (← links)
- Problems related to type-\(A\) and type-\(B\) matrices of chromatic joins (Q1433012) (← links)
- On graphs whose flow polynomials have real roots only (Q1658775) (← links)
- Even subgraph expansions for the flow polynomial of cubic plane maps (Q1823252) (← links)
- On cycles in the sequence of unitary Cayley graphs (Q1827748) (← links)
- \(\sigma\)-polynomials and graph coloring (Q1891610) (← links)
- Counting pure \(k\)-cycles in sequences of Cayley graphs (Q1910564) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Zero-free intervals of chromatic polynomials of hypergraphs (Q2005730) (← links)
- Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs (Q2067108) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← links)
- A categorification for the signed chromatic polynomial (Q2152787) (← links)
- On zero-free intervals of flow polynomials (Q2259860) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- On graphs having no flow roots in the interval \((1,2)\) (Q2341075) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Some array polynomials over special monoid presentations (Q2436340) (← links)
- A note on the permanental roots of bipartite graphs (Q2442268) (← links)
- On golden identities for constrained chromials (Q2541883) (← links)
- Regular major maps of at most 19 regions and their Q-chromials (Q2544364) (← links)
- Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (Q2673487) (← links)
