Opening book details…
Can I read Midwest Theory of Computation Symposium: on a Generalization of Edge-coloring in Graphs on EtoBox?
Midwest Theory of Computation Symposium: on a Generalization of Edge-coloring in Graphs by S. Louis Hakimi; Oded Kariv is a Computer Science article available to read on EtoBox.
What is Midwest Theory of Computation Symposium: on a Generalization of Edge-coloring in Graphs about?
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.
Who reads Midwest Theory of Computation Symposium: on a Generalization of Edge-coloring in Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- S. Louis Hakimi; Oded Kariv
- Publisher
- ACM
- Published
- 1984
- Language
- EN
- Field
- Computer Science (Physical Sciences)