Abstract
A graph is pseudo-median if for every triple u, v, w of vertices there exists either a unique vertex between each pair of them, if their mutual distances sum up to an even number, or a unique triangle whose edges lie between the three pairs of u, v, w, respectively, if the distance sum is odd. We show that every finite pseudo-median graph can be built up by successive amalgamations of smaller pieces. The building stones themselves are certain Cartesian products of wheels, snakes (i.e., path-like 2-trees), and complete graphs minus matchings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
