Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)
- 299 Downloads
In this chapter, we consider results which use assumptions on the degrees or number of edges, thereby driving the proper connection number down.
KeywordsDegree Condition Proper Connection Number Edge-disjoint Triangles Bipartite Version Easy Fact
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 14.Chang, H., Huang, Z., Li, X.: Degree sum conditions for graphs to have proper connection number 2. arXiv:1611.09500v1Google Scholar
- 36.Huang, F., Li, X., Qin, Z., Magnant, C.: Minimum degree condition for proper connection number 2. Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2016.04.042
- 38.Huang, F., Li, X., Wang, S.: Proper connection number and 2-proper connection number of a graph. arXiv:1507.01426Google Scholar
- 49.Li, X., Magnant, C.: Properly colored notions of connectivity – a dynamic survey. Theory Appl. Graphs 0(1), Art. 2 (2015)Google Scholar
© The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature 2018