Abstract
In this chapter, we state some general results for proper connection number of graphs. There is an easy lower bound on pc(G) using the maximum number of bridges (cut edges) incident to a single vertex. All such bridges must receive distinct colors for the coloring to be proper connected, so the following result comes at no surprise.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: On proper-path colorings in graphs. J. Combin. Math. Combin. Comput. 97, 189–207 (2016)
Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: Proper-path colorings in graph operations. Manuscript
Huang, F., Li, X., Wang, S.: Proper connection numbers of complementary graphs. Bull. Malays. Math. Sci. Soc. https://doi.org/10.1007/s40840-016-0381-8
Laforge, E., Lumduanhom, C., Zhang, P.: Characterizations of graphs having large proper connection numbers. Discuss. Math. Graph Theory 36(2), 439–454 (2016)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Li, X., Magnant, C., Qin, Z. (2018). General Results. In: Properly Colored Connectivity of Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-89617-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-89617-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89616-8
Online ISBN: 978-3-319-89617-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)