Independence and upper irredundance in claw-free graphs
From MaRDI portal
Publication:1414584
DOI10.1016/S0166-218X(03)00392-5zbMath1029.05113MaRDI QIDQ1414584
Publication date: 4 December 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (7)
Dominating induced matchings in graphs without a skew star ⋮ Covering Italian domination in graphs ⋮ The enclaveless competition game ⋮ Coloring vertices of claw-free graphs in three colors ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ The total irredundance numbers on graphs ⋮ Irredundance
Cites Work
- Unnamed Item
- Unnamed Item
- Two relations between the parameters of independence and irredundance
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- On Stanley's chromatic symmetric function and clawfree graphs
- Domination and irredundance in cubic graphs
- Upper domination and upper irredundance perfect graphs
- On the independence number in \(K_{1,r+1}\)-free graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- A semi-induced subgraph characterization of upper domination perfect graphs
- Inflated graphs with equal independence number and upper irredundance number
This page was built for publication: Independence and upper irredundance in claw-free graphs
