# Recognizing generalized Petersen graphs in linear time

## TL;DR

This paper presents a linear-time algorithm for recognizing generalized Petersen graphs by identifying a local structural property of edges.

## Contribution

It introduces a novel local property that classifies edges, enabling efficient recognition of generalized Petersen graphs.

## Key findings

- Recognition algorithm runs in linear time
- The method accurately classifies all generalized Petersen graphs
- Provides a new approach for graph recognition tasks

## Abstract

By identifying a local property which structurally classifies any edge, we show that the family of generalized Petersen graphs can be recognized in linear time.