Posets with cover graph of pathwidth two have bounded dimension

DOI10.1007/s11083-015-9359-7zbMath1364.06002arXiv1308.4877MaRDI QIDQ304175

Stephen J. Young, Mitchel T. Keller, Csaba Biró

Publication date: 24 August 2016

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

poset; dimension; treewidth; pathwidth; cover graph

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

Planar posets, dimension, breadth and the number of minimal elements, Minors and dimension, Trees and circle orders, Boolean dimension and local dimension, Dimension of posets with planar cover graphs excluding two long incomparable chains, On the geometric Ramsey number of outerplanar graphs, Improved bound for the dimension of posets of treewidth two, Tree-width and dimension, On the dimension of posets with cover graphs of treewidth 2

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Graph minors. III. Planar tree-width
• Adjacency posets of planar graphs
• Edge subdivision and dimension
• The dimension of planar posets
• S-functions for graphs
• Obstruction set isolation for the gate matrix layout problem
• The dimension of posets with planar cover graphs.
• Tree-width and dimension
• On the dimension of posets with cover graphs of treewidth 2
• Dimension and height for posets with planar cover graphs.
• On the structure of graphs with path-width at most two
• On the dimension of partially ordered sets