Pages that link to "Item:Q413470"
From MaRDI portal
The following pages link to On the complexity of the bondage and reinforcement problems (Q413470):
Displaying 13 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- Edge criticality in graph domination (Q295267) (← links)
- Minimum edge blocker dominating set problem (Q319914) (← links)
- On the complexity of reinforcement in graphs (Q339476) (← links)
- Trees with maximum \(p\)-reinforcement number (Q401133) (← links)
- An improved upper bound for the bondage number of graphs on surfaces (Q449115) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- Bondage number of mesh networks (Q692637) (← links)
- The total bondage number of grid graphs (Q714029) (← links)
- Bondage numbers of Mycielski graphs (Q726515) (← links)
- Bondage number of strong product of two paths (Q893339) (← links)
- Some progress on total bondage in graphs (Q2014725) (← links)
