报告题目：Sudoku Number of Graphs – A New Research Problem
报告人：邵慰慈教授，香港中文大学
报告时间：2025年3月6日（周四）16:00-17:00
报告地点：20-306
报告摘要：We introduced a concept in graph coloring motivated by the popular Sudoku puzzle. Let G = (V, E) be a graph with chromatic number χ(G) = k and let S ⊆ V. Let C0 be a k-coloring of the induced subgraph G[S]. The coloring C0 is called an extendable coloring if C0 can be extended to a k-coloring of G. We say that C0 is a Sudoku coloring of G if C0 can be uniquely extended to a k-coloring of G. The smallest order of such an induced subgraph G[S] of G which admits a Sudoku coloring is called the Sudoku number of G and is denoted by sn(G).
In this talk, we shall show Sudoku number of some graphs.
报告人简介：邵慰慈于1993年获香港大学博士，曾工作于香港浸会大学、北京理工大学（珠海分校）、香港中文大学等，博士生导师。他主要从事图染色、图谱理论、图的化学指数和图标号等方面的研究；曾先后主持了香港研究基金（RGC）和香港浸会大学研究基金（FGC）等多个项目，并在图论知名期刊发表了260余篇学术论文，还主编了《基础离散数学》等教材。
邀请人：王维凡