Skip to main content

Degree Conditions

  • Chapter
  • First Online:
Properly Colored Connectivity of Graphs

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

  • 460 Accesses

Abstract

In this chapter, we consider results which use assumptions on the degrees or number of edges, thereby driving the proper connection number down.

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. Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)

    Book  Google Scholar 

  2. 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 

  3. Brause, C., Doan, T.D., Schiermeyer, I.: Minimum degree conditions for the proper connection number of graphs. Electron. Notes Discrete Math. 55, 109–112 (2016)

    Article  Google Scholar 

  4. Chang, H., Huang, Z., Li, X.: Degree sum conditions for graphs to have proper connection number 2. arXiv:1611.09500v1

    Google Scholar 

  5. Fujita, S., Gerek, A., Magnant, C.: Proper connection with many colors. J. Comb. 3(4), 683–693 (2012)

    MathSciNet  MATH  Google Scholar 

  6. 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

  7. Huang, F., Li, X., Wang, S.: Proper connection number and 2-proper connection number of a graph. arXiv:1507.01426

    Google Scholar 

  8. Huang, F., Li, X., Wang, S.: Upper bounds of proper connection number of graphs. J. Comb. Optim. 34(1), 165–173 (2017)

    Article  MathSciNet  Google Scholar 

  9. Jackson, B.: Long cycles in bipartite graphs. J. Comb. Theory Ser. B 38(2), 118–131 (1985)

    Article  MathSciNet  Google Scholar 

  10. Li, X., Magnant, C.: Properly colored notions of connectivity – a dynamic survey. Theory Appl. Graphs 0(1), Art. 2 (2015)

    Google Scholar 

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

    Article  Google Scholar 

  12. van Aardt, S.A., Brause, C., Burger, A.P., Frick, M., Kemnitz, A., Schiermeyer, I.: Proper connection and size of graphs. Discrete Math. 340(11), 2673–2677 (2017)

    Article  MathSciNet  Google Scholar 

  13. Williamsom, J.E.: Panconnected graphs II. Period. Math. Hung. 8(2), 105–116 (1977)

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

Download citation

Publish with us

Policies and ethics