Work

Properly colored notions of connectivity - a dynamic survey

Year: 2015

Type: article

Abstract: A path in an edge-colored graph is properly colored if no two consecutive edges receive the same color. In this survey, we gather results concerning notions of graph connectivity involving properly colored paths.

Source: Theory and Applications of Graphs

DOI: 10.20429/tag.2015.000102

Authors: Xueliang Li, Colton Magnant

Institutions: Nankai University, Georgia Southern University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: National Natural Science Foundation of China

Awards: G1448350847, G1847366520, G585617737

OpenAlex ID: W2215978024

FWCI: 9.112

Cites: 39

Cited by: 76

Related to: 10