pith. sign in

Title resolution pending

· 2026 · DOI 10.5281/zenodo.20609902

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Computing the Hamiltonian compression factors of cubic graphs

math.CO · 2026-06-20 · unverdicted · novelty 6.0

An algorithm for rotation-invariant Hamiltonian cycles is used to compute compression factors for all cubic edge-transitive graphs on up to 10,000 vertices except two non-Hamiltonian graphs and 98 others with only lower bounds.

citing papers explorer

Showing 1 of 1 citing paper.

  • Computing the Hamiltonian compression factors of cubic graphs math.CO · 2026-06-20 · unverdicted · none · ref 7

    An algorithm for rotation-invariant Hamiltonian cycles is used to compute compression factors for all cubic edge-transitive graphs on up to 10,000 vertices except two non-Hamiltonian graphs and 98 others with only lower bounds.