The structure of graphs with no W_4 immersion
Combinatorics
2018-10-31 v1
Abstract
This paper gives a precise structure theorem for the class of graphs which do not contain as an immersion. This strengthens a previous result of Belmonte at al. that gives a rough description of this class. In fact, we prove a stronger theorem concerning rooted immersions of where one terminal is specified in advance. This stronger result is key in a forthcoming structure theorem for graphs with no immersion.
Cite
@article{arxiv.1810.12863,
title = {The structure of graphs with no W_4 immersion},
author = {Matt DeVos and Mahdieh Malekian},
journal= {arXiv preprint arXiv:1810.12863},
year = {2018}
}
Comments
27 pages, 16 figures