Pathwidth vs Cocircumference

DOI10.1137/23m158663xarXiv2306.03621MaRDI QIDQ6195950

Marcin Briański, Michał T. Seweryn, Gwenaël Joret

Publication date: 14 March 2024

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

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

zbMATH Keywords

treewidthcircumferencepathwidthtreedepthcocircumference

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• First order convergence of matroids
• New spectral lower bounds on the bisection width of graphs
• Graph minors. X: Obstructions to tree-decomposition
• On infinite antichains of matroids
• On Rota's conjecture and excluded minors containing large projective geometries.
• Approximation of pathwidth of outerplanar graphs
• Matroid Pathwidth and Code Trellis Complexity
• Tree-width and circumference of graphs
• Treedepth vs circumference
• Unnamed Item

This page was built for publication: Pathwidth vs Cocircumference