Abstract

AbstractThe class of bipartite permutation graphs enjoys many nice and important properties. In particular, this class is critically important in the study of clique‐ and rank‐width of graphs, because it is one of the minimal hereditary classes of graphs of unbounded clique‐ and rank‐width. It also contains a number of important subclasses, which are critical with respect to other parameters, such as graph lettericity or shrub‐depth, and with respect to other notions, such as well‐quasi‐ordering or complexity of algorithmic problems. In the present paper we identify critical subclasses of bipartite permutation graphs of various types.

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 call

Disclaimer: 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.