scientific article; zbMATH DE number 3801574
From MaRDI portal
Publication:4745845
Cited in
(24)- Star transposition Gray codes for multiset permutations
- Hamiltonian connectivity of 2-tree-generated networks
- scientific article; zbMATH DE number 706769 (Why is no real title available?)
- Determining the Hamilton-connectedness of certain vertex-transitive graphs
- Survey on path and cycle embedding in some networks
- On a combinatorial generation problem of Knuth
- Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- Hamilton-connected derangement graphs on \(S_ n\)
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Some problems on Cayley graphs
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Linearly many faults in Cayley graphs generated by transposition trees
- Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
- The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
- Diagnosability of Cayley graphs generated by transposition trees with missing edges
- The spanning cyclability of Cayley graphs generated by transposition trees
- Random induced subgraphs of Cayley graphs induced by transpositions
- Orienting Cayley graphs generated by transposition trees
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
- Bipancyclic properties of Cayley graphs generated by transpositions
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 Q4745845)