On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
type: Item
instance of: scholarly article
zbMATH Open document ID: 1247.05086
DOI: 10.1142/S1793830912500036
author: Viji Paul
author: K. A. Germina
published in: Discrete Mathematics, Algorithms and Applications
publication date: 2012-08-27T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6072541
zbMATH Keywords: chromatic index
zbMATH Keywords: Erdős-Faber-Lovász conjecture
Wikidata QID: Q122932378
MaRDI profile type: Publication
cites work: Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
cites work: Q4653767
cites work: The chromatic index of cyclic Steiner 2-designs
cites work: On the combinatorial problems which I would most like to see solved
cites work: The Erdős-Faber-Lovász conjecture -- the uniform regular case
cites work: A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
cites work: On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
cites work: A note on the Erdős--Farber--Lovász conjecture
cites work: Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
cites work: A fractional version of the Erdős-Faber-Lovász conjecture
cites work: A remark on the conjecture of Erdös, Faber and Lovász
cites work: The Erdős-Faber-Lovász conjecture for dense hypergraphs
full work available at URL: s1793830912500036
OpenAlex ID: W2136545669
Recommended article: Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
Recommended article: Q3360903
Recommended article: A note on Erd\"os-Faber-Lov\'asz Conjecture and edge coloring of complete graphs
Recommended article: On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
Recommended article: Q5143707
Recommended article: Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
Recommended article: Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
Recommended article: Q4014299
Recommended article: On the number of edges in colour-critical graphs and hypergraphs
Recommended article: On almost-regular edge colourings of hypergraphs
title: On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
description: scientific article; zbMATH DE number 6072541