The game total domination problem is log-complete in PSPACE - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Bostjan Bresar, Michael A. Henning. The game total domination problem is log-complete in PSPACE. Inf. Process. Lett., 126:12-17, 2017. [doi]

The following publications are possibly variants of this publication:

Total Version of the Domination GameMichael A. Henning, Sandi Klavzar, Douglas F. Rall. gc, 31(5):1453-1462, 2015. [doi]

Game total domination for cycles and pathsPaul Dorbec, Michael A. Henning. DAM, 208:7-18, 2016. [doi]

Maker-Breaker total domination gameValentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar. DAM, 282:96-107, 2020. [doi]

Game total domination critical graphsMichael A. Henning, Sandi Klavzar, Douglas F. Rall. DAM, 250:28-37, 2018. [doi]

Trees with equal total domination and game total domination numbersMichael A. Henning, Douglas F. Rall. DAM, 226:58-70, 2017. [doi]

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination GameCsilla Bujtás, Michael A. Henning, Zsolt Tuza. siamdm, 30(3):1830-1847, 2016. [doi]

runs on WebDSL