The Structure of W₄-Immersion-Free Graphs
classification
🧮 math.CO
keywords
graphsstructureboundedconstructedcontainedge-sumsimmersionimmersion-free
read the original abstract
We study the structure of graphs that do not contain the wheel on 5 vertices W4 as an immersion, and show that these graphs can be constructed via 1, 2, and 3-edge-sums from subcubic graphs and graphs of bounded treewidth.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.