Bounds on the Coarseness of the n-Cube

DOI10.4153/CMB-1979-024-2MaRDI QIDQ3877702zbMATH OpenFDO

Authors Jehuda Hartman

Publication date 1979

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

Full work available at URL https://doi.org/10.4153/CMB-1979-024-2

zbMATH Keywords

coarseness of a graphmaximum number of edge-disjoint nonplanar subgraphs

Mathematics Subject Classification ID

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

Cited in

(2)

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

This page was built for publication: Bounds on the Coarseness of the n-Cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3877702)