题目：Circuit Covers in Signed Graphs
报告人：陈静
时间：2021年4月20日 下午3：30-4 : 30
地点：数计学院20幢308
摘要：Let G be a signed graph and F a set of signed circuits in G. F is a signed circuit cover of G if each edge of G is covered at least once by F, and a signed circuit k-cover of G if each edge of G is covered exactly k times by F. The existence of a signed circuit cover in G is equivalent to the existence of a nowhere-zero flow in G. G is coverable if it has a signed circuit cover. In this talk, we will present some results on shortest signed circuit covers and circuit k-covers in coverable signed graphs.
报告人简介：陈静 湖南第一师范学院教授