%0 Journal Article
%T On two conjectures to generalize Vizing's Theorem
%A Claude Berge
%J Le Matematiche
%D 1990
%I University of Catania
%X Visizing'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.
%U http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/656