当前位置: X-MOL 学术Discret. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Game connectivity of graphs
Discrete Mathematics ( IF 0.8 ) Pub Date : 2020-11-01 , DOI: 10.1016/j.disc.2020.112104
Naoki Matsumoto , Tomoki Nakamigawa

Abstract In this paper, we introduce a new game invariant of graphs, called game connectivity, which is related to the connectivity of graphs. We investigate many fundamental and significant topics of the game connectivity of graphs, and propose many open problems and conjectures.

中文翻译:

图的博弈连通性

摘要 在本文中,我们引入了一种新的图博弈不变量,称为博弈连通性,它与图的连通性有关。我们研究了图博弈连通性的许多基本和重要主题,并提出了许多悬而未决的问题和猜想。
更新日期:2020-11-01
down
wechat
bug