A note on edge coloring of linear hypergraphs
From MaRDI portal
Publication:6076845
Recommendations
- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
- On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
- Edge-coloring linear hypergraphs with medium-sized edges
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- The Erdős-Faber-Lovász conjecture for dense hypergraphs
Cites work
- scientific article; zbMATH DE number 4198041 (Why is no real title available?)
- scientific article; zbMATH DE number 3339158 (Why is no real title available?)
- A fractional version of the Erdős-Faber-Lovász conjecture
- A proof of the Erdős-Faber-Lovász conjecture
- Chromatic index of hypergraphs and Shannon's theorem
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- Edge-coloring linear hypergraphs with medium-sized edges
- On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
- On the combinatorial problems which I would most like to see solved
- The chromatic index of simple hypergraphs
This page was built for publication: A note on edge coloring of linear hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076845)