Games on interval and permutation graph representations
DOI10.1016/J.TCS.2015.09.009zbMATH Open1331.05151OpenAlexW1784462007MaRDI QIDQ897865FDOQ897865
Authors: Jessica Enright, Lorna Stewart
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.009
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)
Cites Work
- Graph Classes: A Survey
- Efficient graph representations
- Winning ways for your mathematical plays. Vol. 1.
- Graph theory with applications
- Title not available (Why is that?)
- On the complexity of some two-person perfect-information games
- Title not available (Why is that?)
- Kayles and Nimbers
- Exact algorithms for Kayles
- Complexity of path-forming games
- Games on triangulations
Cited In (1)
This page was built for publication: Games on interval and permutation graph representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897865)