Solving the $106$ years old $3^k$ points problem with the clockwise-algorithm
Fuente:
arXiv
Saved in:
| Main Author: | Ripà, Marco |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Algorithmic releases on the spanning trees of suitable graphs
by: Imbesi, Maurizio, et al.
Published: (2017)
by: Imbesi, Maurizio, et al.
Published: (2017)
Euclidean Tours in Fairy Chess
by: Di Pietro, Gabriele, et al.
Published: (2024)
by: Di Pietro, Gabriele, et al.
Published: (2024)
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)
by: Furmańczyk, Hanna, et al.
Published: (2020)
Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)
by: Junchaya, Enrique, et al.
Published: (2026)
Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)
4-cop-win graphs have at least 19 vertices
by: Turcotte, Jérémie, et al.
Published: (2020)
by: Turcotte, Jérémie, et al.
Published: (2020)
A greedy heuristic for graph burning
by: García-Díaz, Jesús, et al.
Published: (2024)
by: García-Díaz, Jesús, et al.
Published: (2024)
General uncrossing covering paths inside the axis-aligned bounding box
by: Ripà, Marco
Published: (2024)
by: Ripà, Marco
Published: (2024)
A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
by: Milanič, Martin, et al.
Published: (2024)
by: Milanič, Martin, et al.
Published: (2024)
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)
by: Mkrtchyan, Vahan
Published: (2024)
Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)
by: Gollin, J. Pascal, et al.
Published: (2023)
Cops and Robbers on Multi-Layer Graphs
by: Enright, Jessica, et al.
Published: (2023)
by: Enright, Jessica, et al.
Published: (2023)
Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)
by: Milanič, Martin, et al.
Published: (2023)
Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)
by: Rusu, Irena
Published: (2026)
Branch-width of represented matroids in matrix multiplication time
by: Choi, Mujin, et al.
Published: (2026)
by: Choi, Mujin, et al.
Published: (2026)
Proving the existence of Euclidean knight's tours on $n \times n \times \cdots \times n$ chessboards for $n < 4$
by: Ripà, Marco
Published: (2023)
by: Ripà, Marco
Published: (2023)
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
by: Contreras-Mendoza, Fernando Esteban, et al.
Published: (2022)
by: Contreras-Mendoza, Fernando Esteban, et al.
Published: (2022)
Minimum-Link Covering Trails for any Hypercubic Lattice
by: Ripà, Marco
Published: (2022)
by: Ripà, Marco
Published: (2022)
Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)
by: Kirousis, Lefteris, et al.
Published: (2022)
Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)
by: McFarland, Caleb
Published: (2026)
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
by: Boros, Endre, et al.
Published: (2023)
by: Boros, Endre, et al.
Published: (2023)
Hamiltonian Sets of Polygonal Paths in Assembly Graphs
by: Guterman, A., et al.
Published: (2026)
by: Guterman, A., et al.
Published: (2026)
Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)
by: Daneels, Matias, et al.
Published: (2024)
A note on the structure of locally finite planar quasi-transitive graphs
by: Giocanti, Ugo
Published: (2024)
by: Giocanti, Ugo
Published: (2024)
Low Recourse Arborescence Forests Under Uniformly Random Arcs
by: Dahlmeier, J Niklas, et al.
Published: (2025)
by: Dahlmeier, J Niklas, et al.
Published: (2025)
Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
by: Inoue, Yuta, et al.
Published: (2025)
by: Inoue, Yuta, et al.
Published: (2025)
On dispersability of some circulant graphs
by: Kainen, Paul C., et al.
Published: (2021)
by: Kainen, Paul C., et al.
Published: (2021)
A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)
by: Bosch-Calvo, Miguel, et al.
Published: (2023)
Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)
by: Goedgebeur, Jan, et al.
Published: (2024)
Quota Trees
by: White, Tad
Published: (2024)
by: White, Tad
Published: (2024)
Reconstructing a graph from the distance matrix of its boundary
by: Cáceres, José, et al.
Published: (2024)
by: Cáceres, José, et al.
Published: (2024)
The zero blocking numbers of grid graphs
by: Lin, Hau-Yi, et al.
Published: (2025)
by: Lin, Hau-Yi, et al.
Published: (2025)
Zero blocking numbers of graphs with complexity results
by: Lin, Hau-Yi, et al.
Published: (2025)
by: Lin, Hau-Yi, et al.
Published: (2025)
The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
by: Lin, Hau-Yi, et al.
Published: (2025)
by: Lin, Hau-Yi, et al.
Published: (2025)
Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
by: Grigoriev, Alexander, et al.
Published: (2025)
by: Grigoriev, Alexander, et al.
Published: (2025)
Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)
by: Goedgebeur, Jan, et al.
Published: (2024)
COVID on trees and infinite grids
by: Barnett, Andrea, et al.
Published: (2024)
by: Barnett, Andrea, et al.
Published: (2024)
Improved bounds on the cop number when forbidding a minor
by: Kenter, Franklin, et al.
Published: (2023)
by: Kenter, Franklin, et al.
Published: (2023)
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)
by: Paul, Christophe, et al.
Published: (2024)
Similar Items
-
Algorithmic releases on the spanning trees of suitable graphs
by: Imbesi, Maurizio, et al.
Published: (2017) -
Euclidean Tours in Fairy Chess
by: Di Pietro, Gabriele, et al.
Published: (2024) -
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020) -
Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026) -
Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)