Graphs with intrinsic s3 convexities
From MaRDI portal
Publication:3824446
DOI10.1002/jgt.3190130208zbMath0671.05049OpenAlexW1981966510MaRDI QIDQ3824446
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130208
Related Items
Quasi-median graphs from sets of partitions, Separation of two convex sets in convexity structures, Complexity aspects of the triangle path convexity, A Helly theorem for geodesic convexity in strongly dismantlable graphs, Isometric embeddings in Hamming graphs, On finding convex cuts in general, bipartite and plane graphs, Convexity in partial cubes: the hull number, First-order logic axiomatization of metric graph theory, Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity, Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication, The retracts of Hamming graphs, Pseudo-median graphs are join spaces, Prefibers and the cartesian product of metric spaces, Separation properties of 3-Steiner and 3-monophonic convexity in graphs, On tope graphs of complexes of oriented matroids, Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor, On the \(P_3\)-hull number of Kneser graphs, Netlike partial cubes, IV: Fixed finite subgraph theorems, Netlike partial cubes III. The median cycle property, Betweenness in graphs: a short survey on shortest and induced path betweenness
Cites Work
