Chromatic index of hypergraphs and Shannon's theorem
From MaRDI portal
(Redirected from Publication:1580680)
Recommendations
Cites work
- A short proof for a generalization of Vizing's theorem
- A Theorem on Coloring the Lines of a Network
- An application of matching theory of edge-colourings
- Asymptotic behavior of the chromatic index for hypergraphs
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- scientific article; zbMATH DE number 4198041 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3428958 (Why is no real title available?)
- On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
- The chromatic index of simple hypergraphs
Cited in
(6)- Chromatic index of simple hypergraphs
- On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
- The zero-error side information problem and chromatic numbers (Corresp.)
- A note on edge coloring of linear hypergraphs
- The chromatic index of hypergraphs with no intersecting multiple 2-edges
- About Berge-Füredi's conjecture on the chromatic index of hypergraphs
This page was built for publication: Chromatic index of hypergraphs and Shannon's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580680)
