On the structure of graphs excluding K4, W4, K2,4 and one other graph as a rooted minor
Abstract
In this paper we give structural characterizations of graphs not containing rooted K4, W4, K2,4, and a graph we call L.
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.