Proper connection with many colors 693

@inproceedings{Gerek2013ProperCW,
  title={Proper connection with many colors 693},
  author={Aydin Gerek and Shinya Fujita and Colton Magnant},
  year={2013}
}
In this work, we consider only edge-colorings of graphs. Since Vizing’s fundamental result [9], proper edge colorings of graphs, colorings such that no two adjacent edges have the same color, have become an essential topic for every beginning graph theorist. Proper edge colorings have many applications in signal transmission [7], bandwidth allocation [3] and many other areas [5, 6, 8]. See [1] for a survey of the case where two colors (where the term ‘alternating’ can be used in place of… CONTINUE READING
5 Citations
12 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

and Z

  • V. Borozan, S. Fujita, A. Gerek, C. Magnant, Y. Manoussakis, L. Montero
  • Tuza
  • 2012
Highly Influential
8 Excerpts

Proper connection of graphs

  • G. J. Chaitin
  • Discrete Math .
  • 2012

and P

  • G. Chartrand, L. Lesniak
  • Zhang
  • 2011
1 Excerpt

Paths through fixed vertices in edgecolored graphs . Math . In - form

  • D. Dorninger
  • Sci . Humaines
  • 1994

and Zs

  • W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos
  • Tuza
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…