Lower Bounds on the mim-width of Some Graph Classes
Discrete Mathematics
2017-01-05 v2
Abstract
mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs, co-comparability graphs and circle graphs. This improves and refines lower bounds that were known before, some of them only conditionally. In the case of strongly chordal graphs not even a conditional lower bound was known before. All of the bounds given are optimal up to constants.
Cite
@article{arxiv.1608.01542,
title = {Lower Bounds on the mim-width of Some Graph Classes},
author = {Stefan Mengel},
journal= {arXiv preprint arXiv:1608.01542},
year = {2017}
}