Proper k-Connection and Strong Proper Connection
- 307 Downloads
Using a minimum degree assumption to provide density, the following was shown for pc2(G). The proper 2-connection number pc2(G) is the minimum number of colors needed to color the edges of G so that between every pair of vertices, there are at least two internally disjoint proper paths. First we present an easy lemma without proof.
- 38.Huang, F., Li, X., Wang, S.: Proper connection number and 2-proper connection number of a graph. arXiv:1507.01426Google Scholar
- 47.Laforge, E., Zhang, P.: Bounds for proper k-connectivity of complete bipartite graphs. ManuscriptGoogle Scholar
- 48.Laforge, E., Lumduanhom, C., Zhang, P.: Chromatic-connection in graphs. Congressus Numerantium (to appear)Google Scholar