Pseudo-modular graphs

DOI10.1016/0012-365X(86)90212-8zbMath0606.05053MaRDI QIDQ1084416

Henry Martyn Mulder, Hans-Jürgen Bandelt

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

modular graph; median graph; isometric subgraph; pseudo-modular graphs

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

Related Items

Recognizing pseudo-median graphs, Absolute reflexive retracts and absolute bipartite retracts, Pseudo-median graphs are join spaces, Axiomatic characterization of the interval function of a graph, Triangle path transit functions, betweenness and pseudo-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, Powers of distance-hereditary graphs, LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem, The algebra of metric betweenness. I: Subdirect representation and retraction, On Properties of a Graph that Depend on its Distance Function

Cites Work

• Unnamed Item
• Unnamed Item
• Medians in median graphs
• Distance-hereditary graphs
• Connected cutsets of a graph and triangle bases of the cycle space
• Dismantling absolute retracts of reflexive graphs
• Endomorphism semigroups of median algebras
• Absolute retracts of bipartite graphs
• The smallest graph variety containing all paths
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Perfect Elimination and Chordal Bipartite Graphs