Let G be a nontrivial edge-colored connected graph. An edge-cut R of G
i...
More than ten years ago in 2008, a new kind of graph coloring appeared i...
The concept of rainbow connection number of a graph was introduced by
Ch...
The concept of rainbow connection number of a graph was introduced by
Ch...
For an edge-colored graph G, a set F of edges of G is called a
proper ed...
Energy efficiency is an important criterion to judge the quality of mobi...
Let G be a nontrivial connected, edge-colored graph. An edge-cut S of G
...
A path in an(a) edge(vertex)-colored graph is called a conflict-free
pat...
An edge-colored graph G is conflict-free connected if, between each
pair...
Promoting energy efficiency to a first class system design goal is an
im...
Energy efficiency has a significant influence on user experience of
batt...