On two conjectures to generalize Vizing's Theorem
AbstractVisizing's Theorem states that for a single graph G, the chromatic index q(G) is equal to the maximum degree Δ(G) or to Δ(G)+1. To extend this theorem to some classes of hypergraphs, we suggest two conjectures, non-comparable, but, in some sense, dual, which are discussed in the present paper.
The authors retain all rights to the original work without any restrictions.
License for Published Contents
License for Metadata
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.