报告1
题目：On the domination game of graphs
报告人：许克祥 南京航空航天大学
时间：7月21号下午2：00-2：45，地点：1518
摘要：
The domination game played on a graph G consists of two players, Dominator and Staller, who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible, and Staller wishes to delay the process as much as possible. The game domination number γg(G) (resp., γ0 g(G)) is the number of vertices chosen when Dominator (resp., Staller) starts the game and both players play optimally. In the talk we report the recent results on the game domination number of graphs. In particular, we present some results on the graphs G with maximal γg(G) and introduce two new related definitions to the game domination number. Moreover, some interesting open problems are proposed on the domination game of graphs.
报告2
题目：Even cycle decompositions of the line graphs of cubic graphs
报告人：刘文忠 南京航空航天大学
时间：7月21号下午2：45-3：30，地点：1518
摘要：
An even cycle decomposition of a graph is a partition of edges into even cycles. Markstr¨om conjectured that the line graph of a 2-connected cubic graph has an even cycle decomposition and proved the conjecture for 2-connected cubic graphs with oddness at most 2. However for 2-connected cubic graphs with oddness 2, Markstr¨om’s proof does not cover such graphs without 2-factors consisting of only induced cycles. In the paper, we construct infinitely many 2-connected cubic graphs with oddness 2 and no 2-factors consisting of only induced cycles. Further we prove that the conjecture holds for 2-connected cubic graphs with oddness at most 4. This is a joint work with Huazheng You.
报告3
题目：基于图论的超大规模集成电路布线问题研究
报告人：耿显亚 安徽理工大学
时间：7月21号下午3：50-4：35，地点：1518
摘要：布线过程是项很复杂的工作，每个芯片上有数以百万计的模块，单纯靠人工是不可能完成的，这就需要算法和图论的知识来解决。本次主要汇报最近借助图论的方法对相关的布线算法进行研究得到的一些结果。
报告4
题目：图的群联通和模定向问题的一些进展
报告人：赖虹建 美国西弗吉尼亚大学
时间：7月21号下午4：35-5：20，地点：1518
摘要：数学家Tutte在研究4色问题时，首次建立了处处非零流理论，并且提出了著名的3流猜想，4流猜想和5流猜想。在1992年，Jaeger等人提出了处处非零流的非齐次问题，建立了图的群联通理论。相应的关于模定向的非齐次问题在2007年提出。在这个报告里，我们将介绍在这些问题上的一些较新的进展，和下一步希望能解决的问题。