On paths avoding forbidden pairs of vertices in a graph

DOI10.1016/S0166-218X(96)00017-0zbMath0878.68091MaRDI QIDQ678872

Hananya Yinnone

Publication date: 14 December 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

software testingforbidden pairsvalidation\(F\)-cut

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (10)

Analyzing the reachability problem in choice networks ⋮ Sorting with forbidden intermediates ⋮ Reachability in choice networks ⋮ Almost disjoint paths and separating by forbidden pairs ⋮ Constrained hitting set problem with intervals ⋮ Complexity of the path avoiding forbidden pairs problem revisited ⋮ Domination problems with no conflicts ⋮ On the complexity of paths avoiding forbidden pairs ⋮ The checkpoint problem ⋮ Path problems in skew-symmetric graphs

Cites Work

• Unnamed Item
• Maximum number of disjoint paths connecting specified terminals in a graph
• TWO THEOREMS IN GRAPH THEORY
• Paths, Trees, and Flowers

This page was built for publication: On paths avoding forbidden pairs of vertices in a graph