Minimum light numbers in the -game and lit-only -game on unicyclic and grid graphs
From MaRDI portal
(Redirected from Publication:648407)
Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
Recommendations
- Lit-only sigma-game on nondegenerate graphs
- Maximum orbit weights in the -game and lit-only -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
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 -game and lit-only -game on grids and graphs
- Two-lit trees for lit-only \(\sigma \)-game
- Completely symmetric configurations for \(\sigma \)-games on grid graphs
- Lit-only sigma-game on nondegenerate 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)