Advanced search
Publication Cover
Experimental Mathematics Volume 15, 2006 - Issue 3
Submit an article Journal homepage
34
Views
3
CrossRef citations to date
0
Altmetric
Original Article

Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials

P. H. Lundow KTH Physics, AlbaNova University Center, SE-106 91, Stockholm, Sweden
&
K. Markström Department of Mathematics and Mathematical Statistics, Umeå University, SE-901 87, Umeå, Sweden
Pages 343-353 | Published online: 30 Jan 2011

  • Martin Aigner. "Whitney Numbers." In Combinatorial Geometries, pp. 139–160. Cambridge: Cambridge Univ. Press, 1987.
  • Kazuoki Azuma. "Weighted Sums of Certain Dependent Random Variables." Tôhoku Math. J. (2) 19 (1967), 357–367.
  • Norman Biggs. Algebraic Graph Theory, second edition. Cambridge: Cambridge University Press, 1993.
  • Norman Biggs. "A Matrix Method for Chromatic Polynomials." J. Combin. Theory Ser. B 82:1 (2001), 19–29.
  • Norman Biggs. "Equimodular Curves." Discrete Math. 259:1-3 (2002), 37–57.
  • G. D. Birkhoff. "A Determinantal Formula for the Number of Ways of Colouring a Map." Ann. of Math. 14 (1912), 42–46.
  • Béla Bollobás. Random Graphs, second edition. Cambridge: Cambridge University Press, 2001.
  • Francesco Brenti. "Expansions of Chromatic Polynomials and Log-Concavity." Trans. Amer. Math. Soc. 332:2 (1992), 729–756.
  • G. A. Dirac. "On Rigid Circuit Graphs." Abh. Math. Sem. Univ. Hamburg 25 (1961), 71–76.
  • Wayne Goddard, Claire Kenyon, Valerie King, and Leonard J. Schulman. "Optimal Randomized Algorithms for Local Sorting and Set-Maxima." SIAM J. Comput. 22:2 (1993), 272–283.
  • Ronald L. Graham, Andrew C. Yao, and F. Frances Yao. "Information Bounds Are Weak in the Shortest Distance Problem." J. ACM 27:3 (1980), 428–444.
  • Geoffrey Grimmett. "Random Graph Theorems." In Transactions of the Seventh Prague Conference on Information Theory, Statistical Decision Functions, Random Processes and of the Eighth European Meeting of Statisticians (Tech. Univ. Prague, Prague, 1974), vol. A, pp. 203–209. Dordrecht: Reidel, 1977.
  • Gary Haggard and Thomas R Mathies. "The Computation of Chromatic Polynomials." Discrete Math. 199:1-3 (1999), 227–231.
  • András Hajnal and János Surányi. "Über die Auflösung von Graphen in vollständige Teilgraphen." Ann. Univ. Sci. Budapest. Eötvös. Sect. Math. 1 (1958), 113–121.
  • S. G. Hoggar. "Chromatic Polynomials and Logarithmic Concavity." J. Combinatorial Theory Ser. B 16 (1974), 248–254.
  • Bill Jackson. "Zeros of Chromatic and Flow Polynomials of Graphs." Available online (http://xxx. lanl.gov/abs/math.CO/0205047), 2002. http://xxx.lanl.gov/abs/math.CO/0205047
  • Oliver Johnson and Christina Goldschmidt. "Preservation of Log-Concavity on Summation." arXiv.org:math/0502548, 2005.
  • Nabil Kahale and Leonard J. Schulman. "Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph." Combinatorica 16:3 (1996), 383–397.
  • Samuel Karlin. Total Positivity, vol. I. Stanford: Stanford University Press, 1968.
  • BrendanMcKay. "Geng." Available online (http: //cs.anu.edu.au/people/bdm), 1984.
  • L. Moser and M. Wyman. "Asymptotic Development of the Stirling Numbers of the First Kind." J. London Math. Soc. 33 (1958), 133–146.
  • Albert Nijenhuis and Herbert S. Wilf. Combinatorial Algorithms, second edition. New York: Academic Press, 1978.
  • James G. Oxley. Matroid Theory. New York: Oxford University Press, 1992.
  • Ronald C. Read. "An Introduction to Chromatic Polynomials." J. Combinatorial Theory 4 (1968), 52–71.
  • Ronald C. Read. "Broken Wheels Are SLC." Ars Combin. 21 (1986) 123–128.
  • Ronald C. Read and Gordon F. Royle. "Chromatic Roots of Families of Graphs." In Graph Theory, Combinatorics, and Applications, vol. 2, pp. 1009–1029. New York: Wiley, 1991.
  • R. C. Read and W. T. Tutte. "Chromatic Polynomials." In Selected Topics in Graph Theory, 3, pp. 15–42. San Diego: Academic Press, 1988.
  • Alan D. Sokal. "Bounds on the Complex Zeros of (Di)chromatic Polynomials and Potts-Model Partition Functions." Combin. Probab. Comput. 10:1 (2001), 41–77.
  • Alan D. Sokal. "The Multivariate Tutte Polynomial (Alias Potts Model) for Graphs and Matroids." In Surveys in Combinatorics 2005, pp. 173–227. Cambridge: Cambridge University Press, 2005.
  • Richard P. Stanley. "Acyclic Orientations of Graphs." Discrete Math. 5 (1973), 171–178.
  • Carsten Thomassen. "The Zero-Free Intervals for Chromatic Polynomials of Graphs." Combin. Probab. Comput. 6:4 (1997), 497–506.
  • C. Thomassen. "Chromatic Roots and Hamiltonian Paths." J. Combin. Theory Ser. B 80:2 (2000), 218–224.
  • W. T. Tutte. Graph Theory as I Have Known It. New York: Oxford University Press, 1998.
  • Hassler Whitney. "A Logical Expansion in Mathematics." Bull. Amer. Math. Soc. 38 (1932), 572–579.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.