Pages that link to "Item:Q4348784"
From MaRDI portal
The following pages link to Irredundance and Maximum Degree in Graphs (Q4348784):
Displaying 11 items.
- A lower bound for the CO-irredundance number of a graph (Q556836) (← links)
- 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)
- Irredundance in grids (Q1377729) (← 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 total irredundance numbers on graphs (Q3610428) (← links)
- Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
- Partial domination and irredundance numbers in graphs (Q6096253) (← links)