Pages that link to "Item:Q3638039"
From MaRDI portal
The following pages link to A Graph Reduction Step Preserving Element-Connectivity and Applications (Q3638039):
Displaying 21 items.
- A note on Rooted Survivable Networks (Q990935) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Zero forcing in triangulations (Q2423536) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- (Q5002841) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS (Q6124016) (← links)
- On graphs maximizing the zero forcing number (Q6157420) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
- The zero forcing number of claw-free cubic graphs (Q6633547) (← links)
