Skip to main content
Journal ArticleOPEN ACCESS

Properly colored notions of connectivity - a dynamic survey

  • Li X
  • Magnant C
Theory and Applications of Graphs (2015) 0(1)
DOI: 10.20429/tag.2015.000102
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

… A path is called rainbow if no two edges in the path share a color. The rainbow connection … color the graph so that between each pair of vertices, there is a rainbow path. By replacing “…

Cite

CITATION STYLE

APA

Li, X., & Magnant, C. (2015). Properly colored notions of connectivity - a dynamic survey. Theory and Applications of Graphs, 0(1). https://doi.org/10.20429/tag.2015.000102

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