A New Game Invariant of Graphs: the Game Distinguishing Number

From MaRDI portal

Revision as of 11:13, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4557836

Jump to:navigation, search

zbMath1400.05158arXiv1410.3359MaRDI QIDQ4557836

Simon Schmidt, Souad Slimani, Sylvain Gravier, Kahina Meslem

Publication date: 26 November 2018

Full work available at URL: https://arxiv.org/abs/1410.3359

zbMATH Keywords

hypercube combinatorial game graph automorphism distinguishing number

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Trees with distinguishing index equal distinguishing number plus one ⋮ Game connectivity of graphs ⋮ Bichromatic coloring game on triangulations ⋮ Domination game and minimal edge cuts

This page was built for publication: A New Game Invariant of Graphs: the Game Distinguishing Number

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4557836&oldid=18688433"