Pages that link to "Item:Q2447764"
From MaRDI portal
The following pages link to The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764):
Displayed 9 items.
- On the complexity of reinforcement in graphs (Q339476) (← links)
- The \(k\)-rainbow reinforcement numbers in graphs (Q516871) (← links)
- Bondage numbers of Mycielski graphs (Q726515) (← links)
- The total bondage numbers and efficient total dominations of vertex-transitive graphs (Q2333221) (← links)
- On the complexity of multiple bondage in graphs (Q2333796) (← links)
- Complexity and bounds for disjunctive total bondage (Q2661777) (← links)
- The restrained k-rainbow reinforcement number of graphs (Q5013473) (← links)
- (Q5038382) (← links)
- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems (Q5377042) (← links)