A variation of the problem of constructing the shortest closed path in a graph

Finding a path in a graph, which satisfies specified constraints

Fundamental concepts Connectedness Path problems Trees Leaves and lobes The axiom of choice Matching theorems Directed graphs Acyclic graphs Partial order Binary relations and Galois correspondences Connecting paths Dominating sets, covering sets and independent sets Chromatic graphs Groups and graphs Bibliography List of concepts Index of names.

A variation of the problem of constructing the shortest closed path in a graph

Citations

Finding a path in a graph, which satisfies specified constraints

References

Theory of graphs

Related Papers (5)

Shortest admissible paths. I

An approach to determining the minimum cut-set of a graph

The length of a circuit in a strongly connected graph

Asymptotic approach to the problem of k-median of a graph

A circuit-free orientation of the edges of a graph