A generalization of edge‐coloring in graphs
- 1 June 1986
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 10 (2) , 139-154
- https://doi.org/10.1002/jgt.3190100202
Abstract
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(ν) times. The known results and proofs generalize in natural ways. Certain new edge‐coloring problems, which have no counterparts when m(ν) = 1 for all ν ϵ V, are studied.Keywords
This publication has 10 references indexed in Scilit:
- Edge‐coloring of multigraphs: Recoloring techniqueJournal of Graph Theory, 1984
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- On edge-colorings of graphs.MATHEMATICA SCANDINAVICA, 1977
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on itJournal of the London Mathematical Society, 1975
- A Few Remarks on Chromatic SchedulingPublished by Springer Nature ,1975
- How to Color a GraphPublished by Springer Nature ,1975
- On the degrees of the vertices of a directed graphJournal of the Franklin Institute, 1965
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949