On 3-connected graphs of path-width at most three

DOI10.1137/100800452zbMATH Open1278.05230OpenAlexW1981227833MaRDI QIDQ2870519FDOQ2870519

Authors: Guoli Ding, Stan Dziobiak 

Publication date: 21 January 2014

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

Full work available at URL: https://semanticscholar.org/paper/b555a098106fcf81b4cdc47603bf2cd26c210322

Recommendations

• On the structure of graphs with path-width at most two
• Operations which preserve path-width at most two
• Highly connected sets and the excluded grid theorem
• Minimal acyclic forbidden minors for the family of graphs with bounded path-width
• Circumference and pathwidth of highly connected graphs

zbMATH Keywords

graph minorspath-widthtree-width

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Cited In (9)

• A Modern View on Stability of Approximation
• Operations which preserve path-width at most two
• Three-connected graphs whose maximum nullity is at most three
• Circumference and pathwidth of highly connected graphs
• Characterizing width two for variants of treewidth
• Forbidden minors for graphs with no first obstruction to parametric Feynman integration
• Minimum degree of 3-graphs without long linear paths
• The structure of obstructions to treewidth and pathwidth
• On the structure of graphs with path-width at most two

This page was built for publication: On 3-connected graphs of path-width at most three

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