Skip to main content

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

Abstract

Graph connectivity has been studied from a variety of perspectives in applications and theoretical endeavors. In this text, we consider properly colored connectivity of graphs, which are motivated by network connectivity and security applications as well as related theoretical notions.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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. Andrews, E., Laforge, E., Lumduanhom, C., Zhang, P.: On proper-path colorings in graphs. J. Combin. Math. Combin. Comput. 97, 189–207 (2016)

    Google Scholar 

  2. Bang-Jensen J., Gutin, G.: Alternating cycles and paths in edge-coloured multigraphs: a survey. Discrete Math. 165/166, 39–60 (1997). Graphs and Combinatorics (Marseille, 1995)

    Article  MathSciNet  Google Scholar 

  3. Bang-Jensen J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics, 2nd edn. Springer, London (2009)

    Book  Google Scholar 

  4. Borozan, V., Fujita, S., Gerek, A., Magnant, C., Manoussakis, Y., Montero, L., Tuza, Zs.: Proper connection of graphs. Discrete Math. 312(17), 2550–2560 (2012)

    Article  MathSciNet  Google Scholar 

  5. Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Math. Bohem. 133(1), 85–98 (2008)

    Google Scholar 

  6. Chartrand, G., Lesniak, L., Zhang, P.: Graphs & Digraphs, 5th edn. CRC Press, Boca Raton (2011)

    Google Scholar 

  7. Chou, W.S., Manoussakis, Y., Megalakaki, O., Spyratos, M., Tuza, Zs.: Paths through fixed vertices in edge-colored graphs. Math. Inform. Sci. Humaines 127, 49–58 (1994)

    Google Scholar 

  8. Dorninger, D.: On permutations of chromosomes. In: Contributions to General Algebra, vol. 5 (Salzburg, 1986), pp. 95–103. Hölder-Pichler-Tempsky, Vienna (1987)

    Google Scholar 

  9. Dorninger, D., Timischl, W.: Geometrical constraints on Bennet’s predictions of chromosome order. Heredity 58, 321–325 (1987)

    Article  Google Scholar 

  10. König D.: Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann. 77, 453–465 (1916)

    Google Scholar 

  11. Laforge, E., Lumduanhom, C., Zhang, P.: Chromatic-connection in graphs. Congressus Numerantium (to appear)

    Google Scholar 

  12. Li, X., Sun, Y.: Rainbow Connections of Graphs. Springer Briefs in Mathematics. Springer, New York (2012)

    Google Scholar 

  13. Li, X., Sun, Y.: An updated survey on rainbow connections of graphs – a dynamic survey. Theory Appl. Graphs 0(1), Art. 3 (2017)

    Google Scholar 

  14. Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs: a survey. Graphs Comb. 29, 1–38 (2013)

    Article  MathSciNet  Google Scholar 

  15. Menger, K.: Zur allgemeinen Kurventheorie. Fundam. Math. 10, 96–115 (1927)

    Article  Google Scholar 

  16. Vizing, V.Z.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz 3, 25–30 (1964)

    MathSciNet  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). Introduction. In: Properly Colored Connectivity of Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-89617-5_1

Download citation

Publish with us

Policies and ethics