On chromaticity of hypergraphs

Article Properties
Cite
Borowiecki, Mieczysław, and Ewa Łazuka. “On Chromaticity of Hypergraphs”. Discrete Mathematics, vol. 307, no. 11-12, 2007, pp. 1418-29, https://doi.org/10.1016/j.disc.2005.11.079.
Borowiecki, M., & Łazuka, E. (2007). On chromaticity of hypergraphs. Discrete Mathematics, 307(11-12), 1418-1429. https://doi.org/10.1016/j.disc.2005.11.079
Borowiecki M, Łazuka E. On chromaticity of hypergraphs. Discrete Mathematics. 2007;307(11-12):1418-29.
Refrences
Title Journal Journal Categories Citations Publication Date
Chromatic polynomials of hypergraphs Discussiones Mathematicae Graph Theory
  • Science: Mathematics
  • Science: Mathematics
7 2000
Chromatic Coefficients of Linear Uniform Hypergraphs Journal of Combinatorial Theory, Series B
  • Science: Mathematics
13 1998
A broken-circuits-theorem for hypergraphs Archiv der Mathematik
  • Science: Mathematics
1995
On chromaticity of graphs Discussiones Mathematicae Graph Theory
  • Science: Mathematics
  • Science: Mathematics
4 1995
Some results of chromatic hypergraph theory proved by “reduction to graphs” 1976
Refrences Analysis
Category Category Repetition
Science: Mathematics1
The category Science: Mathematics 1 is the most frequently represented among the references in this article. It primarily includes studies from Archiv der Mathematik The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs Graphs and Combinatorics
  • Science: Mathematics
4 2009
Chromatic polynomials of hypergraphs Applied Mathematics Letters
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
6 2007
Citations Analysis
The category Science: Mathematics 2 is the most commonly referenced area in studies that cite this article.