Abstract
Quasimedian graphs are precisely the retracts of Hamming graphs (i.e., of cartesian products of complete graphs) and a retraction can be found in polynomial time. A simple characterization for quasimedian graphs is given. Our main tools are the concept of gated su of complete graphs) and a retraction can be found in polynomial time. A simple characterization for quasimedian graphs is given. Our main tools are the concept of gated subgraphs and a contraction of edges which preserves the essential properties of the investigated graphs.
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.
