Solving 7 7 hex with domination, fill-in, and virtual connections
From MaRDI portal
Publication:817784
Recommendations
- Solutions to seven and a half problems on tilings
- A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID
- Towards resolving Keller's cube tiling conjecture in dimension seven
- Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices
- Packings and coverings of a graph with 6 vertices and 7 edges
- Determining the Heilbronn configuration of seven points in triangles via symbolic computation
- Peg solitaire on graphs with seven vertices or less
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs
- Computer solution of the almost empty hexagon problem
- Graph theory problems from hexagonal and traditional chess
Cites work
- scientific article; zbMATH DE number 1696545 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1209711 (Why is no real title available?)
- scientific article; zbMATH DE number 1944396 (Why is no real title available?)
- scientific article; zbMATH DE number 1784980 (Why is no real title available?)
- scientific article; zbMATH DE number 1404463 (Why is no real title available?)
- scientific article; zbMATH DE number 3334121 (Why is no real title available?)
- Dead Cell Analysis in Hex and the Shannon Game
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Hex strategy: making the right connections
- The Game of Hex and the Brouwer Fixed-Point Theorem
Cited in
(5)
This page was built for publication: Solving \(7\times 7\) hex with domination, fill-in, and virtual connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817784)