A construction of Gray codes inducing complete graphs

DOI10.1016/j.disc.2007.07.116zbMath1144.05037OpenAlexW2078886649MaRDI QIDQ941339

A. J. van Zanten, I. Nengah Suparta

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.116

zbMATH Keywords

complete graphGray code

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Other types of codes (94B60)

Related Items (6)

Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes ⋮ Unnamed Item ⋮ Linear time construction of a compressed Gray code ⋮ A 3D graphical representation of protein sequences based on the Gray code ⋮ Gray codes and symmetric chains ⋮ Some classes of bipartite graphs induced by Gray codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary Gray codes with long bit runs
• Monotone Gray codes and the middle levels problem
• Graphs induced by Gray codes
• Transition restricted Gray codes
• A Technique for Generating Specialized Gray Codes
• Counting sequences

This page was built for publication: A construction of Gray codes inducing complete graphs