scientific article

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

lattice graph Hamming graph semilattices hypercube graph interval function median graph Helly hypergraph

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Paths and cycles (05C38) Graph theory (05C99) Connectivity (05C40) Lattices (06Bxx)

Related Items (only showing first 100 items - show all)

Distance-hereditary graphs ⋮ Pseudo-modular graphs ⋮ Recognizing Hamming graphs in linear time and space ⋮ Cut vertex transit functions of hypergraphs ⋮ Axiomatic characterization of the median function of a block graph ⋮ An ABC-problem for location and consensus functions on graphs ⋮ On local convexity in graphs ⋮ A fixed cube theorem for median graphs ⋮ On the natural imprint function of a graph ⋮ Clique-gated graphs ⋮ Characterization of products of trees and grids ⋮ Generalized hypercubes and (0, 2)-graphs ⋮ The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree ⋮ g-convex weight sequences ⋮ Generalized Hamming graphs: some new results ⋮ Classification of small \((0,2)\)-graphs ⋮ Trees with unique least central subtrees ⋮ The \(t\)-median function on graphs ⋮ A note on path domination ⋮ Fixed hypercube embedding ⋮ Trees, taxonomy, and strongly compatible multi-state characters ⋮ Isometric embeddings in Hamming graphs ⋮ Constructions of ranked posets ⋮ Hereditary modular graphs ⋮ On cube-free median graphs ⋮ Characterizing almost-median graphs ⋮ Convex sets in graphs. II: Minimal path convexity ⋮ Dismantling absolute retracts of reflexive graphs ⋮ The majority strategy on graphs ⋮ Partial cubes and their \(\tau\)-graphs ⋮ Cover-incomparability graphs and chordal graphs ⋮ Maximal proper subgraphs of median graphs ⋮ Steiner intervals in graphs ⋮ A Helly theorem in weakly modular space ⋮ Invariant Hamming graphs in infinite quasi-median graphs ⋮ Guides and shortcuts in graphs ⋮ Retracts of infinite Hamming graphs ⋮ Bucolic complexes ⋮ The median procedure on median graphs ⋮ A note on 3-Steiner intervals and betweenness ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ A note on the interval function of a disconnected graph ⋮ Fast recognition algorithms for classes of partial cubes ⋮ Ramified rectilinear polygons: coordinatization by dendrons ⋮ Diagrams, orientations, and varieties ⋮ Another characterization of hypercubes ⋮ Infinite friendship graphs with infinite parameters ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Superextensions and the depth of median graphs ⋮ Convex sets in lexicographic products of graphs ⋮ Bipartite diametrical graphs of diameter 4 and extreme orders ⋮ Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication ⋮ On the geodetic number of median graphs ⋮ Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs ⋮ Some topological properties of folded Petersen graph ⋮ Binary clustering ⋮ The retracts of Hamming graphs ⋮ Interval-regularity does not lead to interval monotonicity ⋮ On subgraphs in distance-regular graphs ⋮ Pseudo-median graphs are join spaces ⋮ Prefibers and the cartesian product of metric spaces ⋮ Median graphs, parallelism and posets ⋮ Cycle-regular graphs of \((0,\lambda )\)-graph type ⋮ The Helly property and satisfiability of Boolean formulas defined on set families ⋮ Distance monotone graphs and a new characterization of hypercubes ⋮ On the remoteness function in median graphs ⋮ An axiomatization of the median procedure on the \(n\)-cube ⋮ The induced path function, monotonicity and betweenness ⋮ A characterization of bipartite graphs associated with BIB-designs with \(\lambda\)=1 ⋮ Kazhdan and Haagerup properties from the median viewpoint. ⋮ A characterization of planar partial cubes ⋮ On the geodetic number and related metric sets in Cartesian product graphs ⋮ Partial cubes: Structures, characterizations, and constructions ⋮ Cover-incomparability graphs of posets ⋮ Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis ⋮ Cage-amalgamation graphs, a common generalization of chordal and median graphs ⋮ Axiomatic characterization of the interval function of a graph ⋮ Triangle path transit functions, betweenness and pseudo-modular graphs ⋮ Netlike partial cubes III. The median cycle property ⋮ Cube intersection concepts in median graphs ⋮ Recognizing median graphs in subquadratic time ⋮ Netlike partial cubes, V: completion and netlike classes ⋮ Distance monotonicity and a new characterization of Hamming graphs ⋮ Steiner intervals, geodesic intervals, and betweenness ⋮ Induced cycles in crossing graphs of median graphs ⋮ Metric coset schemes revisited ⋮ Not all partial cubes are \(\Theta \)-graceful ⋮ Decomposition and \(l_1\)-embedding of weakly median graphs ⋮ An Euler-type formula for median graphs ⋮ Medians in median graphs ⋮ Infinite generalized friendship graphs ⋮ Interval-regular graphs ⋮ Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces ⋮ Matching binary convexities ⋮ Interval-regular graphs of diameter two ⋮ Networks with Condorcet solutions ⋮ A Helly theorem for convexity in graphs ⋮ From copair hypergraphs to median graphs with latent vertices ⋮ Computing a median point of a simple rectilinear polygon ⋮ A new characterization of median graphs

This page was built for publication: