Edge-coloring Problem Research Articles

Midwest theory of computation symposium

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex v at most m(v) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(v) = 1 for all vεV, are studied.

Erratum: On the edge‐coloring problem for a class of 4‐regular maps

Journal of Graph TheoryVolume 6, Issue 1 p. 93-93 ErratumFree Access Erratum: On the edge-coloring problem for a class of 4-regular maps F. Jaeger, F. Jaeger Laboratoire Imag, Genoble, FranceSearch for more papers by this authorH. Shank, H. Shank University of Waterloo, Waterloo, CanadaSearch for more papers by this author F. Jaeger, F. Jaeger Laboratoire Imag, Genoble, FranceSearch for more papers by this authorH. Shank, H. Shank University of Waterloo, Waterloo, CanadaSearch for more papers by this author First published: Spring 1982 https://doi.org/10.1002/jgt.3190060112AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL No abstract is available for this article. Volume6, Issue1Spring 1982Pages 93-93 RelatedInformation

The edge-coloring of complete hypergraphs I

This paper contains and generalizes the solution of the following classical problem: If h | n then the h-element subsets of an n-element set can be partitioned into ( h−1 n−1 ) classes so that every class contains n h disjoint h-element sets and every h-element set appears in exactly one class. A short formulation of this statement is: If h | n then the hypergraph K n h is 1-factorizable. In this paper we study the factorization and edge-coloring problems of the hypergraph K rxm h (which is the complete, regular, h-uniform, r-partite hypergraph with m vertices in each of the r classes of vertices).