Generalized Gray codes with prescribed ends
From MaRDI portal
Publication:512653
DOI10.1016/j.tcs.2017.01.010zbMath1367.94402arXiv1603.08827OpenAlexW2316555193MaRDI QIDQ512653
Petr Gregor, Václav Koubek, Tomáš Dvořák
Publication date: 27 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.08827
Related Items
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph, Disjoint path covers with path length constraints in restricted hypercube-like graphs, Paired 2-disjoint path covers of burnt pancake graphs with faulty elements, Torus-like graphs and their paired many-to-many disjoint path covers, Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity
Cites Work
- Paired many-to-many disjoint path covers in faulty hypercubes
- Computational complexity of long paths and cycles in faulty hypercubes
- Path partitions of hypercubes
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Path coverings with prescribed ends in faulty hypercubes
- Spanning multi-paths in hypercubes
- Paired many-to-many disjoint path covers of the hypercubes
- On Hamiltonian circuits and spanning trees of hypercubes
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- A Survey of Combinatorial Gray Codes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Unnamed Item
- Unnamed Item
- Unnamed Item
