Dyer, M and Muller, H (2018) Quasimonotone Graphs. In: Graph-Theoretic Concepts in Computer Science. 44th International Workshop on Graph-Theoretic Concepts in Computer Science, 27-29 Jun 2018, Cottbus, Germany. Springer , pp. 190-202.
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
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © Springer Nature Switzerland AG 2018. This is an author produced version of a paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 17 May 2018 12:04 |
Last Modified: | 22 Sep 2018 02:53 |
Published Version: | https://link.springer.com/chapter/10.1007/978-3-03... |
Status: | Published |
Publisher: | Springer |
Identification Number: | 10.1007/978-3-030-00256-5_16 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:131000 |