12月23日上午，应我院邀请，苏州大学计算机科学与技术学院特聘副教授，硕士生导师林政宽博士来我院进行学术交流。

林博士为我院教师做了题为《On the spanning connectivity and spanning laceability of graphs》的报告。报告主要内容为：A Hamiltonian path is a path in a graph that visits each vertex exactly once. A Hamiltonian cycle is a Hamiltonian path that is a cycle. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete.There are many variants of hamiltonian problems such as fault-tolerance hamiltonian, pancyclic, panconnceted, k-ordered hamiltonian, spanning connectivity, etc. In this talk, we focus on the problem of spanning connectivity and spanning laecability.

除了我院教师参加外，还有集美大学的老师也慕名而来，期间各位老师探讨了各种问题，林博士耐心为大家解释说明。