2-walks in 2-tough 2k2-free graphs
Abstract
In this paper, we prove that in every 2-tough 2K2-free graph, there is a 2-walk.
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.