scientific article; zbMATH DE number 5761830
From MaRDI portal
Publication:3575463
zbMATH Open1192.94070MaRDI QIDQ3575463FDOQ3575463
Authors: Darko Dimitrov, Tomáš Dvořák, Petr Gregor, Riste Škrekovski 
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1310/0.html
Title of this publication is not available (Why is that?)
Recommendations
- Combinatorial Gray codes for classes of pattern avoiding permutations
- Some complementary Gray codes
- A technique for generating Gray codes
- More restrictive Gray codes for some classes of pattern avoiding permutations
- Gray codes extending quadratic matchings
- scientific article; zbMATH DE number 706769
- Gray code for derangements
- Gray codes from antimatroids
- Gray code for permutations with a fixed number of left-to-right minima.
- Gray codes, loopless algorithm and partitions
Information theory (general) (94A15) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cited In (17)
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Gray codes extending quadratic matchings
- Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution
- Small matchings extend to Hamiltonian cycles in hypercubes
- Hamiltonian laceability in hypercubes with faulty edges
- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
- Hamiltonian cycles of balanced hypercube with disjoint faulty edges
- Gray codes with bounded weights
- Title not available (Why is that?)
- Towards a problem of Ruskey and Savage on matching extendability
- Matchings extend to Hamiltonian cycles in 5-cube
- Hamiltonian cycles in hypercubes with faulty edges
- A kind of matchings extend to Hamiltonian cycles in hypercubes
- Small matchings extend to Hamiltonian cycles in hypercubes with disjoint faulty edges
- Generalized Gray codes with prescribed ends
- Extending perfect matchings to Gray codes with prescribed ends
- Construction of Hamiltonian cycles with a given spectrum of edge directions in an \(n\)-dimensional Boolean cube
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575463)
