Skip to main content

Other Generalizations

  • Chapter
  • First Online:
Properly Colored Connectivity of Graphs

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

  • 462 Accesses

Abstract

There have been several generalizations or extensions of the proper connection number. We discuss a few of these in this chapter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bi, Z., Byers, A., Zhang, P.: Proper Hamiltonian-connected graphs. Manuscript

    Google Scholar 

  2. Bi, Z., Chartrand, G., Johns, G., Zhang, P.: On minimum spanning subgraphs of graphs with proper connection number 2. Theory Appl. Graphs 3(2), Art. 2 (2016)

    Google Scholar 

  3. Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)

    Book  Google Scholar 

  4. Chang, H., Li, X., Magnant, C., Qin, Z.: The (k, )-proper index of graphs. arXiv:1606.03872v2

    Google Scholar 

  5. Chang, H., Li, X., Qin, Z.: Some upper bounds for the 3-proper index of graphs. Bull. Malays. Math. Sci. Soc. https://doi.org/10.1007/s40840-016-0404-5

  6. Chartrand, G., Devereaux, S., Zhang, P.: Color-connection and information-transfer paths. Manuscript

    Google Scholar 

  7. Chen, L., Li, X., Liu, J.: The k-proper index of graphs. Appl. Math. Comput. 296, 57–63 (2017)

    MathSciNet  Google Scholar 

  8. Coll, V., Hook, J., Magnant, C., McCready, K., Ryan, K.: Proper diameter of graphs. Discuss. Math. Graph Theory (to appear)

    Google Scholar 

  9. Devereaux, S., Johns, G., Zhang, P.: Color connection in graphs intermediate to proper and rainbow connection. Manuscript

    Google Scholar 

  10. Janson, S., Luczak, T., Ruciński, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization, xii+333 pp. Wiley, New York (2000)

    Google Scholar 

  11. Li, W., Li, X., Zhang, J.: The k-proper index of complete bipartite and complete multipartite graphs. Australas. J. Comb. 68(2), 304–316 (2017)

    MathSciNet  MATH  Google Scholar 

  12. Li, X., Magnant, C., Wei, M., Zhu, X.: Distance proper connection of graphs. arXiv:1606.06547

    Google Scholar 

  13. Li, X., Magnant, C., Wei, M., Zhu, X.: Generalized rainbow connection of graphs and their complements. Discuss. Math. Graph Theory https://doi.org/10.7151/dmgt.2011

  14. Melville R., Goddard, W.: Coloring graphs to produce properly colored walks. Graphs Comb. 33(5), 1271–1281 (2017)

    Article  MathSciNet  Google Scholar 

  15. Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. Am. Math. Mon. 46, 281–283 (1939)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 The Author(s), under exclusive licence to Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Li, X., Magnant, C., Qin, Z. (2018). Other Generalizations. In: Properly Colored Connectivity of Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-89617-5_11

Download citation

Publish with us

Policies and ethics