Pages that link to "Item:Q2927651"
From MaRDI portal
The following pages link to An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions (Q2927651):
Displayed 5 items.
- Domination problems with no conflicts (Q1752590) (← links)
- On the complexity of independent dominating set with obligations in graphs (Q2072059) (← links)
- Some Hamiltonian Properties of One-Conflict Graphs (Q2946062) (← links)
- Trees in Graphs with Conflict Edges or Forbidden Transitions (Q4922140) (← links)
- Introduction to routing problems with mandatory transitions (Q6169531) (← links)
