Prefer a chat interface with context about you and your work?
On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2
An edge coloring of a connected graph G is a proper-path coloring if every two vertices of G are connected by a properly colored path. The minimum number of colors required of a proper-path coloring of G is called the proper connection number pc(G) of G. For a connected graph …