Proper Connection with Many ColorsJournal of Combinatorics
AbstractWe 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 InformationShinya 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/