Characterization of the Cartesian product of complete graphs by convex subgraphs

DOI10.1016/0012-365X(86)90149-4zbMath0593.05043MaRDI QIDQ1076038

Yoshimi Egawa

Publication date: 1986

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

zbMATH Keywords

proper convex subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles ⋮ Two characterizations of generalized hypercube

Cites Work

• A characterization of the n-cube by convex subgraphs

This page was built for publication: Characterization of the Cartesian product of complete graphs by convex subgraphs