The number of edges in a subgraph of a Hamming graph

DOI10.1016/S0893-9659(01)80030-6zbMath0996.05079WikidataQ126310837 ScholiaQ126310837MaRDI QIDQ1600356

Andrew Vogt, R. Squier, Bruce Torrence

Publication date: 13 June 2002

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

zbMATH Keywords

Hamming graphsizeCartesian productsubgraphdecomposable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

Crux and Long Cycles in Graphs

Cites Work

• On induced subgraphs of the cube
• Isometric embeddings in Hamming graphs
• On cubical graphs
• Parallel concepts in graph theory
• Distance-preserving subgraphs of hypercubes
• Embedding Trees in a Hypercube is NP-Complete
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS

This page was built for publication: The number of edges in a subgraph of a Hamming graph