Structure of W_4 -immersion free graphs
Résumé
We study the structure of graphs that do not contain the wheel on 5 vertices W 4 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.
Domaines
Mathématique discrète [cs.DM]Origine | Fichiers produits par l'(les) auteur(s) |
---|