The one-cop-moves game on graphs with some special structures

Wang, Lusheng; Yang, Boting

doi:10.1016/j.tcs.2020.09.033

Search citation statements

Order By: Relevance

Paper Sections

Select...

Combinatorial Game Theory1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, there are many research studies about combinatorial game on graphs For example, the Maker-Breaker games (see [13,14,17,18]), the cop and robber games (see [4,22,32]) and the graph coloring games (see [3,5,7]).…”

Section: Combinatorial Game Theorymentioning

confidence: 99%

Graph grabbing games and toucher-isolator games

Boriboon¹

View full text Add to dashboard Cite

In this research, we study the graph grabbing game and the Toucher-Isolator game. In the graph grabbing game, we partially confirm a conjecture of Seacrest and Seacrest which states that Alice wins the game on every weighted connected bipartite even graph. In the Toucher-Isolator game, we give a simple alternative proof of a result of Räty that determines the most suitable tree on n vertices for Toucher which answers a question of Dowden, Kang, Mikalački and Stojaković.

show abstract

Section: Combinatorial Game Theorymentioning

confidence: 99%

Graph grabbing games and toucher-isolator games

Boriboon¹

View full text Add to dashboard Cite

show abstract

The one-cop-moves game on graphs with some special structures

Cited by 1 publication

References 25 publications

Graph grabbing games and toucher-isolator games

Graph grabbing games and toucher-isolator games

Contact Info

Product

Resources

About