报告题目：Complexity and characterizations of edge-related domination and k-factor-criticality of domination-critical graphs
报 告 人: 徐守军 教授（兰州大学）
报告摘要：In this lecture, I will introduce some results on complexity of edge-related domination problems, and on characterizations for trees with properties about edge-related domination parameters. Also I will introduce some results on k-factor-critical properties of (connected-) domination critical graphs.
报告时间: 2020年9月24日(周四) 14:30-15:30
报告地点:腾讯会议室：237-987-694
欢迎各位老师、同学届时前往！
科学技术处
2020年9月22日