Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Melissa A. Huggan"'
Autor:
Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
Publikováno v:
Algorithmica. 85:1067-1090
We consider two variants of orthogonal colouring games on graphs. In these games, two players alternate colouring uncoloured vertices (from a choice of $$m\in {\mathbb {N}}$$ m ∈ N colours) of a pair of isomorphic graphs while respecting the proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41140b615dbb9f522c73cb180d1cb6ba
https://doi.org/10.1007/s00453-022-01069-w
https://doi.org/10.1007/s00453-022-01069-w
Publikováno v:
Journal of Combinatorial Designs. 30:19-47
We introduce an impartial combinatorial game on Steiner triple systems called Nofil. Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. We explore the play of Nofil on all S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ad764dbb5e63449cd2a011b584177ec
https://doi.org/10.1002/jcd.21809
https://doi.org/10.1002/jcd.21809
Publikováno v:
Theoretical Computer Science. 842:133-135
The lower bound for the number of isomorphism classes of graphs admitting a strictly matched involution given in Theorem 15 of our paper on the orthogonal colouring game [1] is incorrect. Here, we prove a weaker lower bound.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0beda016f77db8219483af7d244ca2b
https://doi.org/10.1016/j.tcs.2019.12.007
https://doi.org/10.1016/j.tcs.2019.12.007
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2019, 795, pp.312-325
Theoretical Computer Science, Elsevier, 2019, 795, pp.312-325
Theoretical Computer Science, 2019, 795, pp.312-325
Theoretical Computer Science, Elsevier, 2019, 795, pp.312-325
International audience; We introduce the Orthogonal Colouring Game, in which two players alternately colour vertices (from a choice of m ∈ N colours) of a pair of isomorphic graphs while respecting the properness and the orthogonality of the colour
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e906938e759edd89bd36bdd3dd5dad90
https://doi.org/10.1016/j.tcs.2019.07.014
https://doi.org/10.1016/j.tcs.2019.07.014
Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, many phenomena are comprised of polyadic interactions between more than t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c07be583b4339e61a135a8c0d258d09e
http://arxiv.org/abs/2101.12560
http://arxiv.org/abs/2101.12560
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2021, 874, pp.80-93
Theoretical Computer Science, 2021, 874, pp.80-93
Theoretical Computer Science, Elsevier, 2021, 874, pp.80-93
Theoretical Computer Science, 2021, 874, pp.80-93
International audience; We introduce the game of Cops and Eternal Robbers played on graphs, where there are infinitely many robbers that appear sequentially over distinct plays of the game. A positive integer $t$ is fixed, and the cops are required t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45fed84dd59e647273fefe120b9c1bff
https://hal.archives-ouvertes.fr/hal-03237477/document
https://hal.archives-ouvertes.fr/hal-03237477/document