Chromatic polynomials of hypergraphs

Article Properties
Cite
Borowiecki, Mieczysław, and Ewa Łazuka. “Chromatic Polynomials of Hypergraphs”. Discussiones Mathematicae Graph Theory, vol. 20, no. 2, 2000, p. 293, https://doi.org/10.7151/dmgt.1128.
Borowiecki, M., & Łazuka, E. (2000). Chromatic polynomials of hypergraphs. Discussiones Mathematicae Graph Theory, 20(2), 293. https://doi.org/10.7151/dmgt.1128
Borowiecki M, Łazuka E. Chromatic polynomials of hypergraphs. Discussiones Mathematicae Graph Theory. 2000;20(2):293.
Journal Category
Science
Mathematics
Citations
Title Journal Journal Categories Citations Publication Date
Zero-free intervals of chromatic polynomials of hypergraphs Discrete Mathematics
  • Science: Mathematics
 2 2020
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs European Journal of Combinatorics
  • Science: Mathematics
 6 2017
Series–parallel chromatic hypergraphs Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
 1 2010
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs Graphs and Combinatorics
  • Science: Mathematics
 4 2009
On chromaticity of hypergraphs Discrete Mathematics
  • Science: Mathematics
 2 2007
Citations Analysis
Category Category Repetition
Science: Mathematics7
Technology: Engineering (General). Civil engineering (General)1
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
The category Science: Mathematics 7 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Sunflower hypergraphs are chromatically unique and was published in 2004. The most recent citation comes from a 2020 study titled Zero-free intervals of chromatic polynomials of hypergraphs. This article reached its peak citation in 2007, with 2 citations. It has been cited in 4 different journals. Among related journals, the Discrete Mathematics cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year