A characterization of the n-cube by convex subgraphs
From MaRDI portal
Publication:1165260
DOI10.1016/0012-365X(82)90088-7zbMath0487.05058MaRDI QIDQ1165260
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (3)
Characterization of the Cartesian product of complete graphs by convex subgraphs ⋮ A survey of the theory of hypercube graphs ⋮ Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles
This page was built for publication: A characterization of the n-cube by convex subgraphs
