Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees
From MaRDI portal
Publication:6328606
arXiv1911.02100MaRDI QIDQ6328606
Publication date: 5 November 2019
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Total orders (06A05) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)
This page was built for publication: Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees