Excluding a ladder

DOI10.1007/s00493-021-4592-8OpenAlexW3217207596MaRDI QIDQ2095109

Gwenaël Joret, Paul Wollan, Michał T. Seweryn, Piotr Micek, Tony Huynh

Publication date: 9 November 2022

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

grid graphladderproper vertex coloringexclude some ladder as a minor

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Graph minors (05C83)

Cites Work

• Unnamed Item
• Minors and dimension
• Sparsity. Graphs, structures, and algorithms
• Graph minors. V. Excluding a planar graph
• Contractible edges in 3-connected graphs
• Sparsity and dimension
• Dimension of posets with planar cover graphs excluding two long incomparable chains
• Improved bound for the dimension of posets of treewidth two
• Nowhere dense graph classes and dimension
• Tree-width and dimension
• On the dimension of posets with cover graphs of treewidth 2
• Dimension and height for posets with planar cover graphs.
• Zur Theorie der n-fach zusammenhängenden Graphen
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Graph Theory
• Topological Minors of Cover Graphs and Dimension
• Planar Posets Have Dimension at Most Linear in Their Height
• Dimension and Cut Vertices: An Application of Ramsey Theory
• On the dimension of partially ordered sets