{"paper":{"title":"A width parameter useful for chordal and co-comparability graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dong Yeap Kang, Jan Arne Telle, O-joung Kwon, Torstein J.F. Str{\\o}mme","submitted_at":"2016-06-26T21:29:20Z","abstract_excerpt":"We investigate new graph classes of bounded mim-width, strictly extending interval graphs and permutation graphs. The graphs $K_t \\boxminus K_t$ and $K_t \\boxminus S_t$ are graphs obtained from the disjoint union of two cliques of size $t$, and one clique of size $t$ and one independent set of size $t$ respectively, by adding a perfect matching. We prove that : (1) interval graphs are $(K_3\\boxminus S_3)$-free chordal graphs; and $(K_t\\boxminus S_t)$-free chordal graphs have mim-width at most $t-1$, (2) permutation graphs are $(K_3\\boxminus K_3)$-free co-comparability graphs; and $(K_t\\boxminu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08087","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}