Báo cáo viên: Đoàn Duy Trung
Thời gian: 9h30, Thứ 5, ngày 24 tháng 10 năm 2019
Địa điểm: Phòng 611-612, Nhà A6, Viện Toán học
Tóm tắt: Recently, the new concept on emph{conflict-free connection number} of a connected graph is introduced by Czap. An edge-colored graph $G$ is emph{conflict-free connected} if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The conflict-free connection number of a connected graph $G$, denoted by $cfc(G)$, is the smallest number of colors needed in order to make $G$ conflict-free connected. In our talk, we consider some results on the conflict-free connection number $cfc(G)$ of connected graphs. |
