【国民娱乐每日礼金gm777.top,国民彩票手机版中大奖】我们为您提供国民彩票手机版注册,国民彩票手机版投注,国民彩票手机版app,国民彩票手机版平台,巨华彩票开户,充提快速,操控简单,为国民彩票手机版彩民服务!

行知論壇210:Some results and problems on unique-maximum colorings of plane graphs

時間:2019-07-08瀏覽:126設置

行知論壇 第210(海外學術報告)


報告時間:2019711日上午10:00

報告地點:計算機學院4042

報告題目:Some results and problems on unique-maximum colorings of plane graphs

報 告 人:Riste Skrekovski (研究員,University of Ljubljana)

邀 請 人:王貝貝

報告簡介:A unique-maximum coloring of a plane graph $G$ is a proper vertex coloring by natural numbers such that each face $\alpha$ of $G$ satisfies the propety:  the maximal color that appears on $\alpha$, appears precisely on one vertex of $\alpha$ (or shortly, the maximal color on every face is unique on that face). Fabrici and G\"{o}ring proved that six colors are enough for any plane graph and conjectured that four colors suffice. Thus, this conjecture is a strengthening of the Four Color Theorem. Wendland later decreased the upper bound from six to five.


We first show that the conjecture holds for various subclasses of planar graphs but then we disprove it for planar graphs in general. Thus, the facial unique-maximum chromatic number of the sphere is not four but five. In the second part of the talk, we will consider various new directions and open problems.

報告人簡介:Riste ?krekovski obtained his PhD degree in graph colorings at the University of Ljubljana in 2000 and continued his postdoctoral education at Charles University, Prague, Czech Republic and Simon Fraser University, Burnaby, Canada. Nowadays, he is one of the leading researchers at Faculty of Information Studies of Novo mesto, Slovenia and teach discrete mathematics courses at University of Ljubljana.  His main research interests are various topics in classical graph theory, but he is also interested in applied and interdisciplinary areas as chemical mathematics, complex networks, the arts and mathematics,...




返回原圖
/

国民彩票手机版