scientific article; zbMATH DE number 3801574
From MaRDI portal
Publication:4745845
zbMath0508.05041MaRDI QIDQ4745845
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Related Items (24)
Determining the Hamilton-connectedness of certain vertex-transitive graphs ⋮ Hamilton-connected derangement graphs on \(S_ n\) ⋮ Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs ⋮ Cyclic vertex-connectivity of Cayley graphs generated by transposition trees ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Hamiltonian laceability of bubble-sort graphs with edge faults ⋮ Star transposition Gray codes for multiset permutations ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ Diagnosability of Cayley graphs generated by transposition trees with missing edges ⋮ Orienting Cayley graphs generated by transposition trees ⋮ Some problems on Cayley graphs ⋮ Bipancyclic properties of Cayley graphs generated by transpositions ⋮ Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\) ⋮ Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions ⋮ Hamiltonian connectivity of 2-tree-generated networks ⋮ Unnamed Item ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Survey on path and cycle embedding in some networks
This page was built for publication:
