The bipanconnectivity and m-panconnectivity of the folded hypercube

This publication has 26 references indexed in Scilit:

• The treewidth and pathwidth of hypercubes
  Discrete Mathematics, 2006
• Panconnectivity, fault‐tolerant hamiltonicity and hamiltonian‐connectivity in alternating group graphs
  Networks, 2004
• Complete binary trees in folded and enhanced cubes
  Networks, 2004
• Pancyclicity of recursive circulant graphs
  Information Processing Letters, 2002
• Resource placement in torus-based networks
  IEEE Transactions on Computers, 1997
• Embedding graphs onto the Supercube
  IEEE Transactions on Computers, 1995
• Efficient resource placement in hypercubes using multiple-adjacency codes
  IEEE Transactions on Computers, 1994
• Edge-pancyclic block-intersection graphs
  Discrete Mathematics, 1991
• Properties and performance of folded hypercubes
  IEEE Transactions on Parallel and Distributed Systems, 1991
• Efficient generation of the binary reflected gray code and its applications
  Communications of the ACM, 1976