Twin-width and transductions of proper \(k\)-mixed-thin graphs

DOI10.1007/978-3-031-15914-5_4arXiv2202.12536OpenAlexW4312580329MaRDI QIDQ6043180

Jan Jedelský, Petr Hliněný, Jakub Balabán

Publication date: 5 May 2023

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.12536

zbMATH Keywords

proper interval graphtwin-widthproper mixed-thin graphtransduction equivalence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Twin-width can be exponential in treewidth, Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs, On the thinness of trees

Cites Work

• On the thinness and proper thinness of a graph
• The stable set problem and the thinness of a graph
• Twin-width II: small classes
• Twin-width I: Tractable FO Model Checking