Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Richard J. Nowakowski"'
Autor:
Bruce Landman, Melvyn B. Nathanson, Jaroslav Nešetril, Richard J. Nowakowski, Carl Pomerance, Aaron Robertson
This volume contains selected refereed papers based on lectures presented at the'Integers Conference 2011', an international conference in combinatorial number theory that was held in Carrollton, Georgia, United States in October 2011. This was the f
Autor:
Bruce Landman, Melvyn B. Nathanson, Jaroslav Nešetril, Richard J. Nowakowski, Carl Pomerance, Aaron Robertson
This volume contains selected refereed papers based on lectures presented at the ‘Integers Conference 2007', an international conference in combinatorial number theory that was held in Carrollton, Georgia in October 2007. The proceedings include co
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:
Theoretical Computer Science. 945:113665
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da78f9446340cd1f3cce5aea18b98f2d
https://doi.org/10.1016/j.tcs.2022.12.015
https://doi.org/10.1016/j.tcs.2022.12.015
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