Finding A Path Of Length k: An Expository

Thai Bui

Finding A Path Of Length k: An Expository

Data Structures and Algorithms 2023-04-18 v1 Combinatorics

Authors: Thai Bui

Abstract

Given a graph $G(V, E)$ and a positive integer $k$ ( $k \geq 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.

Keywords

planar graph drawing graph theory

Cite

@article{arxiv.2304.08300,
  title  = {Finding A Path Of Length k: An Expository},
  author = {Thai Bui},
  journal= {arXiv preprint arXiv:2304.08300},
  year   = {2023}
}

Related papers

View all related →