Chromatic index of simple hypergraphs
From MaRDI portal
Publication:2005680
DOI10.1016/j.disc.2020.112087zbMath1452.05072OpenAlexW3081266286MaRDI QIDQ2005680
Publication date: 8 October 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112087
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- The chromatic index of simple hypergraphs
- Matching theory
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Chromatic index of hypergraphs and Shannon's theorem
- A short proof for a generalization of Vizing's theorem
- On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
- A Theorem on Coloring the Lines of a Network
This page was built for publication: Chromatic index of simple hypergraphs