Seymour's conjecture on 2-connected graphs of large pathwidth

DOI10.1007/s00493-020-3941-3zbMath1474.05370arXiv1801.01833OpenAlexW3104777859WikidataQ122878182 ScholiaQ122878182MaRDI QIDQ2663412

Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood

Publication date: 16 April 2021

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

pathwidthouterplanar graph\(2\)-connected graph

Mathematics Subject Classification ID

Graph minors (05C83)

Cites Work

• Unnamed Item
• Graph minors. I. Excluding a forest
• Graph minors. V. Excluding a planar graph
• Quickly excluding a forest
• Matroid Pathwidth and Code Trellis Complexity
• Graph Minors I: A Short Proof of the Path-width Theorem

This page was built for publication: Seymour's conjecture on 2-connected graphs of large pathwidth