Pages that link to "Item:Q1627151"
From MaRDI portal
The following pages link to On minimum connecting transition sets in graphs (Q1627151):
Displaying 8 items.
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Finding paths in graphs avoiding forbidden transitions (Q1861577) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- The Minset-Poset Approach to Representations of Graph Connectivity (Q4962223) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- (Q6065468) (← links)
- On Minimum Connecting Transition Sets in Graphs (Q6304514) (← links)
- Trails in arc-colored digraphs avoiding forbidden transitions (Q6561576) (← links)