Minimum light numbers in the -game and lit-only -game on unicyclic and grid graphs
zbMATH Open1229.05086MaRDI QIDQ648407FDOQ648407
Authors: Xinmao Wang, Yaokun Wu, John Goldwasser
Publication date: 22 November 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p214.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Lit-only sigma-game on nondegenerate graphs
- Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
- scientific article; zbMATH DE number 1161323
- Lightness of digraphs in surfaces and directed game chromatic number
- On the game domination number of graphs with given minimum degree
- Lit-only \(\sigma \)-game on pseudo-trees
- A polynomial bound on the number of light cycles in an undirected graph
- Completely symmetric configurations for \(\sigma \)-games on grid graphs
- The game \(L(d,1)\)-labeling problem of graphs
- Minimum degree games for graphs
Trees (05C05) Combinatorial optimization (90C27) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Topological dynamics (37B99)
Cited In (6)
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- Lit-only sigma game on a line graph
- Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs
- Two-lit trees for lit-only \(\sigma \)-game
- Lit-only sigma-game on nondegenerate graphs
- Completely symmetric configurations for \(\sigma \)-games on grid graphs
This page was built for publication: Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648407)