Pages that link to "Item:Q793760"
From MaRDI portal
The following pages link to The irredundance number and maximum degree of a graph (Q793760):
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)
- Irredundancy in circular arc graphs (Q686248) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Open irredundance and maximum degree in graphs (Q998417) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Coalescence and criticality of graphs (Q1945953) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Inequalities involving the irredundance number of a graph (Q2576844) (← links)
- Irredundance (Q3384112) (← links)
- Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
