On game chromatic vertex-critical graphs
From MaRDI portal
Publication:2107136
DOI10.1007/s40840-022-01418-6zbMath1504.05191arXiv2105.09674OpenAlexW3162632569MaRDI QIDQ2107136
Publication date: 1 December 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09674
game chromatic numbergame coloringvertex-criticalityindependence game chromatic numberindicated game chromatic number
Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adapted game colouring of graphs
- Indicated coloring of matroids
- Domination game critical graphs
- On indicated coloring of graphs
- A bound for the game chromatic number of graphs
- Majority coloring game
- Indicated coloring of graphs
- Game total domination critical graphs
- Indicated coloring game on Cartesian products of graphs
- On indicated chromatic number of graphs
- The game of arboricity
- Incidence Coloring Game and Arboricity of Graphs
- Domination Game and an Imagination Strategy
- The game chromatic number of trees and forests
- Efficient Graph Packing via Game Colouring
- ON THE COMPLEXITY OF SOME COLORING GAMES
- The independence coloring game on graphs
- The Map-Coloring Game
- The incidence game chromatic number
- Competitive colorings of oriented graphs
- On the oriented game chromatic number
This page was built for publication: On game chromatic vertex-critical graphs