Abstract
A bipartite graph with partite sets X and Y is a permutation bigraph if there are two linear orderings of its vertices such that xy is an edge for x∈X and y∈Y if and only if x appears later than y in the first ordering and earlier than y in the second ordering. We characterize permutation bigraphs in terms of representations using intervals. We determine which permutation bigraphs are interval bigraphs or indifference bigraphs in terms of the defining linear orderings. Finally, we show that interval containment posets are precisely those whose comparability bigraphs are permutation bigraphs, via a theorem showing that a directed version of interval containment provides no more generality than ordinary interval containment representation of posets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.