Cliquewidth and dimension

DOI10.1112/PLMS.70116MaRDI QIDQ6873795zbMATH OpenFDO

Authors Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak

Publication date 16 January 2026

Published in Proceedings of the London Mathematical Society. Third Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/PLMS.70116

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorics of partially ordered sets (06A07)

Cites work

• \(k\)-NLC graphs and polynomial algorithms
• A Combinatorial Theorem for Trees
• A survey of -boundedness
• Boolean dimension and tree-width
• Cover graphs and order dimension
• Directed NLC-width
• Excluding a ladder
• Graph minors. V. Excluding a planar graph
• Graph searching and a min-max theorem for tree-width
• Graph structure and monadic second-order logic. A language-theoretic approach
• Graphs of bounded cliquewidth are polynomially -bounded
• scientific article; zbMATH DE number 4118416 (Why is no real title available?)
• scientific article; zbMATH DE number 7788458 (Why is no real title available?)
• Improved bound for the dimension of posets of treewidth two
• On a problem of formal logic.
• On locally presented posets
• On the dimension of partially ordered sets
• On the dimension of posets with cover graphs of treewidth 2
• Partially ordered sets.
• Posets with cover graph of pathwidth two have bounded dimension
• The dimension of planar posets
• The dimension of posets with planar cover graphs.
• The factorisation forest theorem
• Upper bounds to the clique width of graphs

This page was built for publication: Cliquewidth and dimension

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