Retracts of hypercubes
From MaRDI portal
Publication:3344238
DOI10.1002/jgt.3190080407zbMath0551.05060OpenAlexW1977241111WikidataQ60962143 ScholiaQ60962143MaRDI QIDQ3344238
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080407
Related Items
There are no finite partial cubes of girth more than 6 and minimum degree at least 3, Faster isometric embedding in products of complete graphs, Distributive lattice structure on the set of perfect matchings of carbon nanotubes, The algebra of metric betweenness. I: Subdirect representation and retraction, A fixed cube theorem for median graphs, On the natural imprint function of a graph, Computing median and antimedian sets in median graphs, Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry, Clique-gated graphs, Inversions, cuts, and orientations, Generalized Hamming graphs: some new results, A fixed box theorem for the cartesian product of graphs and metric spaces, Maximal proper subgraphs of median graphs, Uprooted phylogenetic networks, Graphs with a regular endomorphism monoid, Retracts of infinite Hamming graphs, Beyond Helly graphs: the diameter problem on absolute retracts, Skeletons, recognition algorithm and distance matrix of quasi-median graphs, Bucolic complexes, Graphs with \(G^p\)-connected medians, Subquadratic-time algorithm for the diameter and all eccentricities on median graphs, Resonance graphs on perfect matchings of graphs on surfaces, First-order logic axiomatization of metric graph theory, Isometric Hamming embeddings of weighted graphs, Diagrams, orientations, and varieties, Retract rigid Cartesian products of graphs, Regular median graphs of linear growth, Tree-like partial Hamming graphs, On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes, Distance and routing labeling schemes for cube-free median graphs, Vertex-transitive median graphs of non-exponential growth, Graphs of some CAT(0) complexes, Netlike partial cubes. I. General properties, Cost thresholds for dynamic resource location, The retracts of Hamming graphs, On retracts, absolute retracts, and foldings in cographs, Counting vertices and cubes in median graphs of circular split systems, On the clone of aggregation functions on bounded lattices, Finding the prime factors of strong direct product graphs in polynomial time, Retracts of strong products of graphs, A new fixed point approach for stable networks and stable marriages, Retracts of Products of Chordal Graphs, Two-ended regular median graphs, Unnamed Item, Fully gated graphs: Recognition and convex operations, Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor, Weakly Modular Graphs and Nonpositive Curvature, Netlike partial cubes II. Retracts and netlike subgraphs, Absolute retracts of bipartite graphs, Recognizing median graphs in subquadratic time, Transitive, locally finite median graphs with finite blocks, On median nature and enumerative properties of Fibonacci-like cubes, What Do Trees and Hypercubes Have in Common?
