Advanced search
Publication Cover
Experimental Mathematics Volume 30, 2021 - Issue 4
Submit an article Journal homepage
100
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Hamiltonian Maker–Breaker Games on Small Graphs

Miloš StojakovićDepartment of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Novi Sad, SerbiaORCID Iconhttps://orcid.org/0000-0002-2545-8849
ORCID Icon &
Nikola TrkuljaDepartment of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Novi Sad, SerbiaCorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0001-6606-390X
ORCID Icon
Pages 595-604 | Published online: 13 Apr 2019

References

  • [Chvátal and Erdős 78] V. Chvátal and P. Erdős. “Biased Positional Games.” Ann. Discrete Math. 2 (1978), 221–229.
  • [Clemens et al. 15] D. Clemens, A. Ferber, R. Glebov, D. Hefetz, and A. Liebenau. “Building Spanning Trees Quickly in Maker-Breaker Games.” SIAM J. Discrete Math. 29:3 (2015), 1683–1705.
  • [Hefetz et al. 11] D. Hefetz, M. Krivelevich, M. Stojaković, and T. Szabó. “Global Maker–Breaker Games on Sparse Graphs.” Eur. J. Comb. 32:2 (2011), 162–177.
  • [Hefetz et al. 14] D. Hefetz, M. Krivelevich, M. Stojaković, and T. Szabó. Positional Games. Oberwolfach Seminars 44. Birkhäuser, 2014.
  • [Hefetz and Stich 09] D. Hefetz and S. Stich. “On Two Problems Regarding the Hamiltonian Cycle Game.” Electr. J. Comb. 16:1 (2009), R28.
  • [Krivelevich 11] M. Krivelevich. “The Critical Bias for the Hamiltonicity Game is (1+o(1))n/ ln n.” J. Am. Math. Soc. 24:1 (2011), 125–131.
  • [McKay 81] B. D. McKay. “Practical Graph Isomorphism.” Congr. Numer. 30 (1981), 45–87.
  • [McKay and Piperno 14] B. D. McKay and A. Piperno. “Practical Graph Isomorphism: II.” J. Symb. Comput. 60:0 (2014), 94–112.
  • [McKay and Piperno 16] B. D. McKay and A. Piperno. “Nauty and Traces User’s Guide (Version 2.6).” Technical report, 2016.
  • [Millington and Funge 09] I. Millington and J. Funge. Artificial Intelligence for Games, Second Edition. ‎Burlington: Morgan Kaufmann Publishers Inc., 2009.
  • [Papaioannou 82] A. Papaioannou. A Hamiltonian game. Annals of Discrete Math, 13:171–178, 1982.
  • [Russell and Norvig 09] S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach, Third edition. Upper Saddle River: Prentice Hall Press, 2009.
  • [Spermann and Leuschel 08] C. Spermann and M. Leuschel. “ProB gets Nauty: Effective Symmetry Reduction for B and Z Models.” In TASE, pp. 15–22. IEEE Computer Society, 2008.
  • [Trove] Trove. Trove - High Performance Collections for Java. (http://trove.starlight-systems.com) accessed December 19, 2016.
  • [Turner 07] E. Turner, M. Leuschel, C. Spermann, and M. Butler. “Symmetry Reduced Model Checking for B.” In TASE, pp. 25–34. IEEE Computer Society, 2007.
  • [West 01] D. West. Introduction to Graph Theory. Upper Saddle River: Prentice Hall, 2001.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.