The Proper Diameter of a Graph
A proper edge-coloring of a graph is a coloring in which adjacent edges receive distinct colors. A path is properly colored if consecutive edges have distinct colors, and an edge-colored graph is properly connected if there exists a properly colored path between every pair of vertices. In such a gra...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2115 |