Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On 3-Connected Graphs of Path-Width at Most Three

From MaRDI portal
Publication:2870519
Jump to:navigation, search

DOI10.1137/100800452zbMath1278.05230OpenAlexW1981227833MaRDI QIDQ2870519

Stan Dziobiak, Guoli Ding

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


zbMATH Keywords

tree-widthgraph minorspath-width


Mathematics Subject Classification ID

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


Related Items (2)

A Modern View on Stability of Approximation ⋮ Forbidden minors for graphs with no first obstruction to parametric Feynman integration






This page was built for publication: On 3-Connected Graphs of Path-Width at Most Three

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2870519&oldid=15817359"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki