报告题目：The proper connection of graphs
报告人：李学良
报告时间：
地点：1518
摘要：
An edge-colored graph is called properlyconnected if for any two distinct vertices there is a properly colored pathconnecting them. For a connected graph G, the proper connection number of G isdefined as the minimum number of colors that are needed to make G properlyconnected. This talk will give a survey for the results on the properconnection of graphs. Some unsolved problems or conjectures fromliterature are also presented.