Pseudo-modular graphs
A graph is called pseudo-modular if, given any three vertices u, v, w, there are shortest uv-, uw- and vw-paths either passing through a vertex or pairwise sharing edges of a triangle. Cycles of length \(>4\), the so- called 'house' graph and the '3-sun' graph are examples of graphs that are not pseudo-modular. Now pseudo-modular graphs cannot be characterized by forbidden subgraphs since every graph can be embedded in a pseudo- modular graph. However, suppose that an induced subgraph H of a graph G is called isometric if every shortest path in H is also a shortest path in G, and call G hereditary pseudo-similar if every isometric subgraph of G is pseudo-similar. Then one of the results in this paper is that if G does not contain a house, a 3-sun or a cycle of length \(>4\) as an isometric subgraph then G is hereditary pseudo-similar.
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Absolute retracts of bipartite graphs
- Connected cutsets of a graph and triangle bases of the cycle space
- Dismantling absolute retracts of reflexive graphs
- Distance-hereditary graphs
- Endomorphism semigroups of median algebras
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3463659 (Why is no real title available?)
- Medians in median graphs
- Perfect Elimination and Chordal Bipartite Graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- The smallest graph variety containing all paths
- Axiomatic characterization of the interval function of a graph
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Hereditary modular graphs
- A note on distance matrices with unicyclic graph realizations
- A Helly theorem in weakly modular space
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
- Separation of two convex sets in convexity structures
- A note on \(r\)-dominating cliques
- Homogeneously orderable graphs
- Obstructions to a small hyperbolicity in Helly graphs
- Powers of distance-hereditary graphs
- Modular intersection graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Invariant subgraph properties in pseudo-modular graphs
- Injective hulls of various graph classes
- Probabilistic pursuits on graphs
- The algebra of metric betweenness. I: Subdirect representation and retraction
- Axiomatic characterization of the interval function of a block graph
- Pseudo-hamiltonian graphs
- On Properties of a Graph that Depend on its Distance Function
- Weakly Modular Graphs and Nonpositive Curvature
- scientific article; zbMATH DE number 175734 (Why is no real title available?)
- Dominating cliques in distance-hereditary graphs
- Recognizing pseudo-median graphs
- A story of diameter, radius, and (almost) Helly property
- Graphs with \(G^p\)-connected medians
- Dually chordal graphs
- First-order logic axiomatization of metric graph theory
- Helly groups, coarsely Helly groups, and relative hyperbolicity
- Helly groups
- Absolute reflexive retracts and absolute bipartite retracts
- Pseudo-median graphs are join spaces
This page was built for publication: Pseudo-modular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084416)