Edge-coloring of 3-uniform hypergraphs

Berge, 1990, On two conjectures to generalize Vizing’s theorem, Matematiche, 45, 15 Brandstadt, 1999 Brooks, 1941, On colouring the nodes of a network, Proc. Cambridge Philos. Soc., Math. Phys. Sci., 37, 194, 10.1017/S030500410002168X Clos, 1953, A study of nonblocking switching networks, Bell Syst. Tech. J., 32, 406, 10.1002/j.1538-7305.1953.tb01433.x Even, 1976, On the complexity of time table and multi-commodity flow problems, SIAM J. Comput., 5, 691, 10.1137/0205048 Fiala, 2003, NP completeness of the edge precoloring extension problem on bipartite graphs, J. Graph Theory, 43, 156, 10.1002/jgt.10088 Garey, 1980, The complexity of coloring circular arcs and chords, SIAM J. Algebr. Discrete Methods, 1, 216, 10.1137/0601025 Holyer, 1981, The NP-completeness of edge-colouring, SIAM J. Comput., 10, 718, 10.1137/0210055 Hwang, 2004 Obszarski, 2006, Hipergrafowy model szeregowania w rozrzedzonych systemach zadań wieloprocesorowych, Zeszyty Nauk. Wydziału ETI Politech. Gdańskiej, 10, 499 Pippenger, 1989, Asymptotic behavior of the chromatic index for hypergraphs, J. Combin. Theory Ser. A, 51, 24, 10.1016/0097-3165(89)90074-5 Shih, 1989, An O(n1.5) algorithm to color proper circular arcs, Discrete Appl. Math., 25, 321, 10.1016/0166-218X(89)90011-5 Teng, 1985, An O(qn) algorithm to q-color a proper family of circular arcs, Discrete Math., 55, 233, 10.1016/0012-365X(85)90052-4 Vizing, 1964, On an estimate of the chromatic class of a p-graph, Diskret. Anal., 3, 25