KnowraPath graphLinked fromLinked fromThe 9 pages that link to Path graph, each with the reason it gives.All 9Broader topic 5Related 2Narrower topic 1Compared with 1Bipartite graphRelated: Alternating between the two vertex sets along paths underlies bipartite coloring.Complete graphCompared with: A path has only enough edges to connect the vertices in sequence.Path (graph theory)Broader topic: It is the graph formed when one path contains all vertices and no extra edges.Line graphBroader topic: Taking a line graph shortens a path by one edge-vertex step.LabyrinthNarrower topic: It models the route structure of a simple unicursal labyrinth.Undirected graphBroader topic: It is the simplest connected undirected graph with more than one vertex.Matching polynomialBroader topic: Its matching polynomial follows a simple recurrence and has explicit roots.Hosoya indexBroader topic: Its matching counts follow a Fibonacci recurrence, giving a simple model for index computation.Balinski's theoremRelated: Paths through polytope faces provide routes connecting surviving vertices.