课题基金 / 基金详情

Some Problems in Graph Theory

Some Problems in Graph Theory
图论中的一些问题
批准号:
RGPIN-2015-06258
负责人:
Clarke, Nancy
金额:
$0.8万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2015
资助国家:
加拿大
项目状态:
已结题
起止时间:
2015-01-01 至 2016-12-31

项目摘要

项目成果

Clarke, Nancy的其他基金

相似基金

相关文献

中文摘要
翻译
图是一组顶点和一组边。这些图是很好的模型。例如,我们可以用顶点来表示地图的区域,只要相应的区域共享一个非平凡的边界,就有两个相邻的顶点,即由一条边连接起来。在打印地图时,最好将所需的颜色数量降至最低,以便共享同一边界的区域获得不同的颜色。对于相应的图,我们想要最小化给顶点着色所需的颜色的数量,使相邻的顶点得到不同的颜色。这就是研究得很好的图着色问题。
英文摘要
A graph is a set of vertices together with a set of edges. Graphs make great models. For instance, we can represent the regions of a map by vertices, with two vertices adjacent, i.e. joined by an edge, whenever the corresponding regions share a non-trivial border. When printing maps, it is desirable to minimize the number of colours needed so that regions which share a border receive different colours. In terms of the corresponding graph, we would like to minimize the number of colours, or simply labels, needed to colour the vertices in such a way that adjacent vertices receive different colours. This is the well-studied graph colouring problem.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Some Further Problems in Graph Theory
  • 批准号:
    RGPIN-2020-06528
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.31万
  • 财政年份:
    2022
  • 负责人:
    Clarke, Nancy
  • 依托单位:
Some Further Problems in Graph Theory
  • 批准号:
    RGPIN-2020-06528
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.31万
  • 财政年份:
    2021
  • 负责人:
    Clarke, Nancy
  • 依托单位:
Some Further Problems in Graph Theory
  • 批准号:
    RGPIN-2020-06528
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.31万
  • 财政年份:
    2020
  • 负责人:
    Clarke, Nancy
  • 依托单位:
Some Problems in Graph Theory
  • 批准号:
    RGPIN-2015-06258
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $0.8万
  • 财政年份:
    2019
  • 负责人:
    Clarke, Nancy
  • 依托单位:
海外基金