Finding A Path Of Length k: An Expository
Abstract
Given a graph G(V, E) and a positive integer k (k ≥ 1), a simple path on k vertices is a sequence of k vertices in which no vertex appears more than once and each consecutive pair of vertices in the sequence are connected by an edge. This paper provides an overview of current research on the existence and counting of k-paths in graphs.
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.