On paths avoding forbidden pairs of vertices in a graph
From MaRDI portal
Publication:678872
DOI10.1016/S0166-218X(96)00017-0zbMATH Open0878.68091MaRDI QIDQ678872FDOQ678872
Authors: 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
Recommendations
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
- On the complexity of paths avoiding forbidden pairs
- On the path avoiding forbidden pairs polytope
- Finding paths in graphs avoiding forbidden transitions
- Forbidden paths and cycles in ordered graphs and matrices
- Paths with restricted degrees of their vertices in planar graphs
- Characterizing path graphs by forbidden induced subgraphs
- Nonempty intersection of longest paths in graphs without forbidden pairs
- Characterizing forbidden pairs for relative length of longest paths and cycles
- On vertex-degree restricted paths in polyhedral graphs
Cites Work
Cited In (14)
- Reachability in choice networks
- Constrained hitting set problem with intervals
- Domination problems with no conflicts
- Characterizing forbidden pairs for relative length of longest paths and cycles
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
- On the path avoiding forbidden pairs polytope
- Almost disjoint paths and separating by forbidden pairs
- Analyzing the reachability problem in choice networks
- On the complexity of paths avoiding forbidden pairs
- Path problems in skew-symmetric graphs
- The checkpoint problem
- On legal path problems in digraphs
- On vertex-degree restricted paths in polyhedral graphs
- Complexity of the path avoiding forbidden pairs problem revisited
This page was built for publication: On paths avoding forbidden pairs of vertices in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678872)
