Irredundance perfect graphs
From MaRDI portal
Publication:1896349
DOI10.1016/0012-365X(93)E0213-NzbMath0832.05059OpenAlexW2080145949MaRDI QIDQ1896349
Publication date: 20 February 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0213-n
redundant vertexdominating setdomination numberforbidden subgraphsirredundance numberirredundance perfect
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ Irredundance ⋮ Upper domination and upper irredundance perfect graphs
Cites Work
- On domination and independent domination numbers of a graph
- The irredundance number and maximum degree of a graph
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On the product of upper irredundance numbers of a graph and its complement
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Irredundance number versus domination number
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- Critical concepts in domination
- Irredundant ramsey numbers for graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- On irredundant Ramsey numbers for graphs
- THE IRREDUNDANT RAMSEY NUMBER s(3,6)
- Stability, domination and irredundance in a graph
- Total Domination and Irredundance in Weighted Interval Graphs
- A characterization of domination perfect graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- The ratio of the distance irredundance and domination numbers of a graph
- The Private Neighbor Cube
- A note on the characterization of domination perfect graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Irredundance perfect graphs
