Dyer, M and Muller, H (2019) Quasimonotone graphs. Discrete Applied Mathematics, 271. pp. 25-48. ISSN 0166-218X
Abstract
For any class C of bipartite graphs, we define quasi-C to be the class of all graphs G such that every bipartition of G belongs to C. This definition is motivated by a generalisation of the switch Markov chain on perfect matchings from bipartite graphs to nonbipartite graphs. The monotone graphs, also known as bipartite permutation graphs and proper interval bigraphs, are such a class of bipartite graphs. We investigate the structure of quasi-monotone graphs and hence construct a polynomial time recognition algorithm for graphs in this class.
Metadata
Authors/Creators: |
|
||||||
---|---|---|---|---|---|---|---|
Copyright, Publisher and Additional Information: | © 2019 The Author(s). Published by Elsevier B.V. This is an open access article under the terms of the CC-BY-4.0 licence: https://creativecommons.org/licenses/by/4.0/ | ||||||
Keywords: | Hereditary graph class; Switch Markov chain; Bipartite permutation graph; Monotone graph; Polynomial time recognition | ||||||
Dates: |
|
||||||
Institution: | The University of Leeds | ||||||
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) | ||||||
Funding Information: |
|
||||||
Depositing User: | Symplectic Publications | ||||||
Date Deposited: | 20 Aug 2019 12:57 | ||||||
Last Modified: | 25 Jun 2023 21:57 | ||||||
Status: | Published | ||||||
Publisher: | Elsevier | ||||||
Identification Number: | https://doi.org/10.1016/j.dam.2019.08.006 |