On a vertex-edge marking game on graphs
From MaRDI portal
Publication:2660140
Recommendations
Cites work
- Activation strategy for asymmetric marking games
- Competitive colorings of oriented graphs
- Game chromatic number of Cartesian product graphs
- Graph theory
- scientific article; zbMATH DE number 3604926 (Why is no real title available?)
- Note on the game colouring number of powers of graphs
- On chromatic number of graphs and set-systems
- On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Planar orientations with low out-degree and compaction of adjacency matrices
- Refined activation strategy for the marking game
- Some Theorems on Abstract Graphs
- The game chromatic number and the game colouring number of cactuses
- The game coloring number of planar graphs
- The Map-Coloring Game
- The two-coloring number and degenerate colorings of planar graphs
- Very asymmetric marking games
This page was built for publication: On a vertex-edge marking game on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2660140)