Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs

DOI10.4230/lipics.approx/random.2021.61arXiv2102.11728OpenAlexW3203640610MaRDI QIDQ6070400

Unnamed Author, Reut Levi

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2102.11728

zbMATH Keywords

Hamiltonian pathproperty testingminor free graphssparse spanning sub-graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs