Recommendations
Cites work
- -graphs of graphs
- A characterization of \(\Gamma\alpha(k)\)-perfect graphs
- A disproof of Henning's conjecture on irredundance perfect graphs
- A lower bound for irredundant Ramsey numbers
- A lower bound for the CO-irredundance number of a graph
- A lower bound for the irredundance number of trees
- A new lower bound on upper irredundance in the queens' graph
- A note on -graphs
- A note on graphs which have upper irredundance equal to independence
- A note on some variations of the -graph
- A note on the irredundance number after vertex deletion
- A note on total domination
- A semi-induced subgraph characterization of upper domination perfect graphs
- An improved upper bound for queens domination numbers
- Asymptotic bounds for irredundant and mixed Ramsey numbers
- ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS
- Avoidance colourings for small nonclassical Ramsey numbers
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Changing upper irredundance by edge addition
- Chessboard domination problems
- Chordal graphs and upper irredundance, upper domination and independence
- CO-irredundant Ramsey numbers for graphs
- Coalescence and criticality of graphs
- Computational methods and new results for chessboard problems
- Contributions to the theory of domination, independence and irredundance in graphs
- Domination and irredundance in cubic graphs
- Domination and irredundance in the queens' graph
- Domination parameters and edge-removal-critical graphs
- Domination-balanced graphs
- Extremal graphs for a new upper bound on domination parameters in graphs
- Forbidden graphs and irredundant perfect graphs
- Gallai-type theorems and domination parameters
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 4174974 (Why is no real title available?)
- scientific article; zbMATH DE number 4174975 (Why is no real title available?)
- scientific article; zbMATH DE number 3884201 (Why is no real title available?)
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3859049 (Why is no real title available?)
- scientific article; zbMATH DE number 3869363 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 4202304 (Why is no real title available?)
- scientific article; zbMATH DE number 4210179 (Why is no real title available?)
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 4164900 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 4045795 (Why is no real title available?)
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 4093496 (Why is no real title available?)
- scientific article; zbMATH DE number 4095510 (Why is no real title available?)
- scientific article; zbMATH DE number 4101267 (Why is no real title available?)
- scientific article; zbMATH DE number 89760 (Why is no real title available?)
- scientific article; zbMATH DE number 3627237 (Why is no real title available?)
- scientific article; zbMATH DE number 1208728 (Why is no real title available?)
- scientific article; zbMATH DE number 1080082 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1124599 (Why is no real title available?)
- scientific article; zbMATH DE number 1151819 (Why is no real title available?)
- scientific article; zbMATH DE number 1156597 (Why is no real title available?)
- scientific article; zbMATH DE number 1933059 (Why is no real title available?)
- scientific article; zbMATH DE number 2061808 (Why is no real title available?)
- scientific article; zbMATH DE number 1501970 (Why is no real title available?)
- scientific article; zbMATH DE number 1506496 (Why is no real title available?)
- scientific article; zbMATH DE number 1506498 (Why is no real title available?)
- scientific article; zbMATH DE number 1506502 (Why is no real title available?)
- scientific article; zbMATH DE number 1506509 (Why is no real title available?)
- scientific article; zbMATH DE number 1792610 (Why is no real title available?)
- scientific article; zbMATH DE number 6933310 (Why is no real title available?)
- scientific article; zbMATH DE number 2163987 (Why is no real title available?)
- scientific article; zbMATH DE number 795022 (Why is no real title available?)
- scientific article; zbMATH DE number 1416461 (Why is no real title available?)
- scientific article; zbMATH DE number 1416467 (Why is no real title available?)
- scientific article; zbMATH DE number 1416471 (Why is no real title available?)
- scientific article; zbMATH DE number 2192119 (Why is no real title available?)
- Independence and irredundance in \(k\)-regular graphs
- Independence and upper irredundance in claw-free graphs
- Independence, irredundance, degrees and chromatic number in graphs
- Inequalities relating domination parameters in cubic graphs
- Inflated graphs with equal independence number and upper irredundance number
- Irredundance and domination in kings graphs
- Irredundance and Maximum Degree in Graphs
- Irredundance in grids
- Irredundance in inflated graphs
- Irredundance number versus domination number
- Irredundance perfect andP6-free graphs
- Irredundance perfect graphs
- Irredundance, secure domination and maximum degree in trees
- Irredundance-edge-removal-critical graphs
- Irredundancy in circular arc graphs
- Irredundant ramsey numbers for graphs
- Linear-time computation of optimal subgraphs of decomposable graphs
- Locally well-dominated and locally independent well-dominated graphs
- Mixed Ramsey Numbers Revisited
- Nordhaus-Gaddum results for CO-irredundance in graphs
- On domination and annihilation in graphs with claw-free blocks
- On equality in an upper bound for domination parameters of graphs
- On graphs having domination number half their order
- On the complexity landscape of the domination chain
- On the differences between the upper irredundance, upper domination and independence numbers of a graph
- On the product of upper irredundance numbers of a graph and its complement
- On the ratios between packing and domination parameters of a graph
- On the sum of two parameters concerning independence and irredundance in a graph
- On upper domination Ramsey numbers for graphs.
- Open irredundance and maximum degree in graphs
- Preperfect graphs
- Proof of a conjecture on irredundance perfect graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
- Properties of queens graphs and the irredundance number of \(Q_7\)
- Relations between the lower domination parameters and the chromatic number of a graph.
- Stability, domination and irredundance in a graph
- The domination parameters of cubic graphs
- The irredundance number and maximum degree of a graph
- The irredundant ramsey number s(3, 7)
- The irredundant ramsey number s(3,3,3) = 13
- THE IRREDUNDANT RAMSEY NUMBER s(3,6)
- The mixed irredundant Ramsey numberst(3, 7) = 18 andt(3, 8) = 22
- The Private Neighbor Cube
- The rati of the irredundance and domination number of a graph
- The ratio of the irredundance number and the domination number for block-cactus graphs
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- The upper domination Ramsey number \(u(3,3,3)\)
- Triangulations and equality in the domination chain
- Two relations between the parameters of independence and irredundance
- Upper domination and upper irredundance perfect graphs
- Values of domination numbers of the queen's graph
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- Vertex criticality for upper domination and irredundance
- Well irredundant graphs
Cited in
(24)- Irredundance and domination in kings graphs
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Irredundance trees of diameter 3
- Forbidden graphs and irredundant perfect graphs
- On the complexity landscape of the domination chain
- Full Reduction in the Face of Absurdity
- The upper irredundance number of the crown
- Stability, domination and irredundance in a graph
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 109204 (Why is no real title available?)
- scientific article; zbMATH DE number 1151800 (Why is no real title available?)
- \({\mathcal R}\)-proper and \({\mathcal R}\)-limited parametric chains
- scientific article; zbMATH DE number 6007 (Why is no real title available?)
- scientific article; zbMATH DE number 795022 (Why is no real title available?)
- On unique realizations of domination chain parameters
- Text redundancies
- Redundancy and Helly
- Generating minimal redundant and maximal irredundant subhypergraphs
- Bounds for irredundant and co-irredundant Ramsey numbers
- Minority sets in graphs
- On irredundance coloring and irredundance compelling coloring of graphs
- Zero forcing irredundant sets
- On maximizing private neighbors in graphs
- Universal perspectives on irredundance for X-set parameters
This page was built for publication: Irredundance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384112)
