报告题目：Connection problems of connected graphs
报告人：Trung Duy Doan，Hanoi University of Science and Technology
报告时间：6月15日 周一 4:00-5:00
报告地点：二教2106
摘要：
In the last years, the connection concepts of connected graphs appeared in graph theory and received many attentions. Let G be a connected and edge-coloured graph. A path P in the graph G is called P path if its edges are assigned colours with P property. The edge-coloured graph G is P connected if every pair vertices are connected by at least one P path in G. The P connection number of the graph G, denoted by P(G), is the smallest number of colours in order to make it P connected. In our talk, we will present some results on these topics.