The following pages link to (Q4211755):
Displayed 13 items.
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← links)
- Open irredundance and maximum degree in graphs (Q998417) (← links)
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs (Q1292835) (← links)
- Irredundant and perfect neighbourhood sets in trees (Q1584343) (← links)
- Changing upper irredundance by edge addition (Q1810642) (← links)
- New bounds for the broadcast domination number of a graph (Q1955610) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Irredundance (Q3384112) (← links)
- The Private Neighbor Concept (Q3384113) (← links)
- Vertex sequences in graphs (Q5862692) (← links)