Pages that link to "Item:Q413470"
From MaRDI portal
The following pages link to On the complexity of the bondage and reinforcement problems (Q413470):
Displayed 10 items.
- Trees with maximum \(p\)-reinforcement number (Q401133) (← links)
- An improved upper bound for the bondage number of graphs on surfaces (Q449115) (← links)
- Bondage number of mesh networks (Q692637) (← links)
- The total bondage number of grid graphs (Q714029) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Some progress on total bondage in graphs (Q2014725) (← links)
- On the \(p\)-reinforcement and the complexity (Q2253958) (← links)
- Domination in certain chemical graphs (Q2263696) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH (Q4928332) (← links)