The Hamilton compression of highly symmetric graphs

DOI10.4230/LIPICS.MFCS.2022.54MaRDI QIDQ6584056zbMATH OpenFDO

Authors Petr Gregor, Arturo I. Merino, Torsten Mütze

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.54

zbMATH Keywords

abelian groupCayley graphgray codeHamilton cyclehypercubeJohnson graphpermutahedronvertex-transitive

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Generating all invertible matrices by row operations
• Generating all invertible matrices by row operations

This page was built for publication: The Hamilton compression of highly symmetric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584056)