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

DOI10.1016/J.DISC.2024.113876MaRDI QIDQ6552597

J. Jedelsky, Jakub Balabán, Petr Hliněný

Publication date: 10 June 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

proper interval graphtwin-widthproper mixed-thin graphtransduction equivalencered potential method

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Graph theory (05Cxx)

Cites Work

• On the thinness and proper thinness of a graph
• The stable set problem and the thinness of a graph
• Twin-width I: Tractable FO Model Checking
• Twin-width IV: ordered graphs and matrices
• Deciding twin-width at most 4 is NP-complete
• Twin-width. VI: The lens of contraction sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Twin-width and transductions of proper \(k\)-mixed-thin graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552597)