The chromatic index of hypergraphs with no intersecting multiple 2-edges

DOI10.1016/J.DAM.2025.12.004MaRDI QIDQ6866644zbMATH OpenFDO

Authors Zhimin Wang, Guiying Yan, Xia Zhang

Publication date 28 January 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.12.004

zbMATH Keywords

chromatic indexDvořák's conjectureedge coloringhypergraphShannon's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites work

• A proof of the Erdős-Faber-Lovász conjecture
• A short proof for a generalization of Vizing's theorem
• A Theorem on Coloring the Lines of a Network
• Chromatic index of hypergraphs and Shannon's theorem
• scientific article; zbMATH DE number 4198041 (Why is no real title available?)
• scientific article; zbMATH DE number 3428958 (Why is no real title available?)
• On an estimate of the chromatic class of a \(p\)-graph
• 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: The chromatic index of hypergraphs with no intersecting multiple 2-edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866644)