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
A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the...
An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a pat...
The concept of \emph{proper connection number} of graphs is an extension of proper colouring and is ...
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same col...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
A comprehensive survey of proper connection of graphs is discussed in this book with real world appl...
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a pro...
An edge-colored directed graph is called properly connected if, between every pair of vertices, ther...
An edge-colored directed graph is called properly connected if, between every pair of vertices, ther...
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a pro...
Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of...
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a pro...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the...
An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a pat...
The concept of \emph{proper connection number} of graphs is an extension of proper colouring and is ...
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same col...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
We say an edge-colored graph is properly connected if, between every pair of vertices, there exists ...
A comprehensive survey of proper connection of graphs is discussed in this book with real world appl...
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a pro...
An edge-colored directed graph is called properly connected if, between every pair of vertices, ther...
An edge-colored directed graph is called properly connected if, between every pair of vertices, ther...
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a pro...
Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of...
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a pro...
AbstractAn edge-coloring of a connected graph is monochromatically-connecting if there is a monochro...
A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the...
An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a pat...
The concept of \emph{proper connection number} of graphs is an extension of proper colouring and is ...
DOI
Add to ORKG