On edge numberings of the \(n\)-cube graph

DOI10.1016/0166-218X(93)90023-HzbMath0786.05047MaRDI QIDQ689968

Norbert Grünwald, Karl Weber, Sergei L. Bezrukov

Publication date: 16 January 1994

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

zbMATH Keywords

sequences\(n\)-cubeedge numberings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items

New results on edge-bandwidth, On the edge-bandwidth of graph products

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the edges of the n-cube
• Minimum range sequences of all k-subsets of a set
• The optimal number of faces in cubical complexes
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices