Title

Proper Connection with Many Colors

Document Type

Article

Publication Date

2012

Publication Title

Journal of Combinatorics

DOI

10.4310/JOC.2012.v3.n4.a6

ISSN

2150-959X

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).

Share

COinS