Two Sufficient Conditions for 2-Connected Graphs to Have Proper Connection Number 2
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-019-00868-9
Abstract: The proper connection number of a graph G , denoted by pc ( G ), is the minimum number of colors needed to color the edges of G so that every pair of distinct vertices… read more here.
Keywords: proper connection; number; connected graph; connection number ... See more keywords