Bounds on the Coarseness of the n-Cube

DOI10.4153/CMB-1979-024-2zbMath0437.05016MaRDI QIDQ3877702

Jehuda Hartman

Publication date: 1979

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

coarseness of a graphmaximum number of edge-disjoint nonplanar subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

A survey of the theory of hypercube graphs, Entropy distribution of localised states