Graph grabbing game on graphs with forbidden subgraphs
From MaRDI portal
Cites work
- A Graph-Grabbing Game
- A new characterization of \(P_{6}\)-free graphs
- A note on concurrent graph sharing games
- Dominating subgraphs in graphs with some forbidden structures
- Grabbing the gold
- Graph sharing game and the structure of weighted graphs with a forbidden subdivision
- Graph sharing games: complexity and connectivity
- Graph theory
- Hamiltonian results inK1,3-free graphs
- Hamiltonicity in claw-free graphs
- How to eat 4/9 of a pizza
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 2050057 (Why is no real title available?)
- On Hamiltonicity of \{claw, net\}-free graphs
- Parity in graph sharing games
- Solution of Peter Winkler's pizza problem
- The graph grabbing game on \(\{0,1\}\)-weighted graphs
- The graph grabbing game on \(K_{m, n}\)-trees
- Tough graphs and Hamiltonian circuits.
This page was built for publication: Graph grabbing game on graphs with forbidden subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985943)