Graphs 4n that are isometrically embeddable in hypercubes
Michel Deza, Mathieu Dutour-Sikiric, Sergey Shpectorov
Abstract
A connected 3-valent plane graph, whose faces are q- or 6-gons only, is called a graph qn. We classify all graphs 4n, which are isometric subgraphs of a m-hypercube Hm.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.