Bounded degree, triangle avoidance graph games
From MaRDI portal
Publication:2376102
Recommendations
Cites work
- A note on the one-colour avoidance game on graphs
- An upper bound on the extremal version of Hajnal's triangle-free game
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Connected, bounded degree, triangle avoidance games
- scientific article; zbMATH DE number 3900800 (Why is no real title available?)
- scientific article; zbMATH DE number 140096 (Why is no real title available?)
- scientific article; zbMATH DE number 1735736 (Why is no real title available?)
- scientific article; zbMATH DE number 1944410 (Why is no real title available?)
- On Hajnal's triangle-free game
- Online balanced graph avoidance games
- Online Ramsey games for triangles in random graphs
- Online Ramsey games in random graphs
- Ramsey Games Against a One-Armed Bandit
- The first player wins the one-colour triangle avoidance game on 16 vertices
- Upper bounds for online Ramsey games in random graphs
Cited in
(10)- Minimum degree games for graphs
- Game matching number of graphs
- Bichromatic triangle games
- The star avoidance game
- scientific article; zbMATH DE number 3877237 (Why is no real title available?)
- On Degree Achievement and Avoidance Games for Graphs
- scientific article; zbMATH DE number 140096 (Why is no real title available?)
- scientific article; zbMATH DE number 1735736 (Why is no real title available?)
- Connected, bounded degree, triangle avoidance games
- An upper bound on the extremal version of Hajnal's triangle-free game
This page was built for publication: Bounded degree, triangle avoidance graph games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376102)