Skip to main content
Book Chapter

Rainbow path and minimum degree in properly edge colored graphs

  • Das A
  • Suresh P
  • Subrahmanya S
Scuola Normale Superiore, (2013), 319-325
DOI: 10.1007/978-88-7642-475-5_51
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Das, A., Suresh, P., & Subrahmanya, S. V. (2013). Rainbow path and minimum degree in properly edge colored graphs. In The Seventh European Conference on Combinatorics, Graph Theory and Applications (pp. 319–325). Scuola Normale Superiore. https://doi.org/10.1007/978-88-7642-475-5_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free