2000 character limit reached
Minor-closed graph classes with bounded layered pathwidth
Published 19 Oct 2018 in math.CO and cs.DM | (1810.08314v2)
Abstract: We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded pathwidth if and only if some forest is not in the class.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.