The structure of graphs with no W4 immersion
Abstract
This paper gives a precise structure theorem for the class of graphs which do not contain W4 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 W4 where one terminal is specified in advance. This stronger result is key in a forthcoming structure theorem for graphs with no K3,3 immersion.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.