Quasimonotone graphs
From MaRDI portal
Publication:5918199
DOI10.1016/j.dam.2019.08.006zbMath1428.05255OpenAlexW4240268902MaRDI QIDQ5918199
Publication date: 27 November 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.006
switch Markov chainbipartite permutation graphhereditary graph classmonotone graphpolynomial time recognition
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Detecting holes and antiholes in graphs
- Recognizing graphs without asteroidal triples
- Bipartite permutation graphs
- A short proof that `proper = unit'
- Cyclic Haar graphs
- Doubly Lexical Orderings of Matrices
- Graph Classes: A Survey
- On the Switch Markov Chain for Perfect Matchings
- Interval bigraphs and circular arc graphs
- Counting Perfect Matchings and the Switch Chain
- Statistical problems involving permutations with restricted positions
- On the Möbius Ladders
- Quasimonotone graphs
This page was built for publication: Quasimonotone graphs