Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Brown, J.I.
Hickman, C.A.
and
Nowakowski, R.J.
2004.
The k-fractal of a simplicial complex.
Discrete Mathematics,
Vol. 285,
Issue. 1-3,
p.
33.
Swartz, E.
2004.
Lower Bounds forh-Vectors ofk-CM, Independence, and Broken Circuit Complexes.
SIAM Journal on Discrete Mathematics,
Vol. 18,
Issue. 3,
p.
647.
Royle, Gordon
and
Sokal, Alan D.
2004.
The Brown–Colbourn conjecture on zeros of reliability polynomials is false.
Journal of Combinatorial Theory, Series B,
Vol. 91,
Issue. 2,
p.
345.
Choe, Young-Bin
Oxley, James G.
Sokal, Alan D.
and
Wagner, David G.
2004.
Homogeneous multivariate polynomials with the half-plane property.
Advances in Applied Mathematics,
Vol. 32,
Issue. 1-2,
p.
88.
Jacobsen, Jesper Lykke
Salas, Jesús
and
Sokal, Alan D.
2005.
Spanning Forests and the q-State Potts Model in the Limit q →0.
Journal of Statistical Physics,
Vol. 119,
Issue. 5-6,
p.
1153.
Choe, YoungBin
2005.
Polynomials with the half-plane property and the support theorems.
Journal of Combinatorial Theory, Series B,
Vol. 94,
Issue. 1,
p.
117.
Charalambides, Marios
and
Waleffe, Fabian
2008.
Spectrum of the Jacobi Tau Approximation for the Second Derivative Operator.
SIAM Journal on Numerical Analysis,
Vol. 46,
Issue. 1,
p.
280.
Brown, J. I.
and
Dilcher, K.
2009.
On the roots of strongly connected reliability polynomials.
Networks,
Vol. 54,
Issue. 2,
p.
108.
Jackson, Bill
and
Sokal, Alan D.
2009.
Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids.
Journal of Combinatorial Theory, Series B,
Vol. 99,
Issue. 6,
p.
869.
Brown, J.I.
and
Cox, D.
2009.
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.
Discrete Mathematics,
Vol. 309,
Issue. 16,
p.
5043.
Charalambides, Marios
and
Csordas, George
2010.
The distribution of zeros of a class of Jacobi polynomials.
Proceedings of the American Mathematical Society,
Vol. 138,
Issue. 12,
p.
4345.
Sankar, Basu
2011.
On the relevance of certain results from multidimensional circuits and systems theory in some nontraditional problem areas.
p.
1.
Brown, Jason
and
Oellermann, Ortrud R.
2014.
Graphs with a Minimal Number of Convex Sets.
Graphs and Combinatorics,
Vol. 30,
Issue. 6,
p.
1383.
Brown, Jason I.
and
Tufts, Julia
2014.
On the Roots of Domination Polynomials.
Graphs and Combinatorics,
Vol. 30,
Issue. 3,
p.
527.
Savage, Carla
and
Visontai, Mirkó
2014.
The 𝐬-Eulerian polynomials have only real roots.
Transactions of the American Mathematical Society,
Vol. 367,
Issue. 2,
p.
1441.
Brown, Jason
and
Erey, Aysel
2014.
A note on the real part of complex chromatic roots.
Discrete Mathematics,
Vol. 328,
Issue. ,
p.
96.
Charalambides, Marios
2014.
A new property of a class of Koornwinder Laguerre polynomials.
Integral Transforms and Special Functions,
Vol. 25,
Issue. 8,
p.
634.
Royle, Gordon F.
and
Sokal, Alan D.
2015.
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 29,
Issue. 4,
p.
2117.
Hyatt, Matthew
2016.
Recurrences for Eulerian Polynomials of Type B and Type D.
Annals of Combinatorics,
Vol. 20,
Issue. 4,
p.
869.
Brändén, Petter
Krasikov, Ilia
and
Shapiro, Boris
2016.
Elements of Pólya-Schur theory in the finite difference setting.
Proceedings of the American Mathematical Society,
Vol. 144,
Issue. 11,
p.
4831.