Skip to main content
Article
Proper Connection with Many Colors
Journal of Combinatorics
  • Shinya Fujita, Maebashi Institute of Technology
  • Aydin Gerek, Lehigh University
  • Colton Magnant, Georgia Southern University
Document Type
Article
Publication Date
1-1-2012
DOI
10.4310/JOC.2012.v3.n4.a6
Disciplines
Abstract
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists a properly colored path. For a graph G, define the proper connection number pc(G) to be the minimum number of colors k such that there exists a k-coloring of E(G) which is properly connected. In this work, we study conditions on G which force upper bounds on pc(G).
Citation Information
Shinya Fujita, Aydin Gerek and Colton Magnant. "Proper Connection with Many Colors" Journal of Combinatorics Vol. 3 Iss. 4 (2012) p. 683 - 693
Available at: http://works.bepress.com/colton_magnant/30/