Louartiti, Khalid Zero-divisor graphs of small upper irredundance number. (English) Zbl 07801876 Bol. Soc. Parana. Mat. (3) 40, Paper No. 88, 5 p. (2022). MSC: 16S50 13A99 05C99 PDFBibTeX XMLCite \textit{K. Louartiti}, Bol. Soc. Parana. Mat. (3) 40, Paper No. 88, 5 p. (2022; Zbl 07801876) Full Text: DOI
Hedetniemi, Stephen T.; Mcrae, Alice A.; Mohan, Raghuveer The private neighbor concept. (English) Zbl 1479.05273 Haynes, Teresa W. (ed.) et al., Structures of domination in graphs. Cham: Springer. Dev. Math. 66, 183-218 (2021). MSC: 05C69 PDFBibTeX XMLCite \textit{S. T. Hedetniemi} et al., Dev. Math. 66, 183--218 (2021; Zbl 1479.05273) Full Text: DOI
Mynhardt, C. M.; Roux, A. Irredundance. (English) Zbl 1522.05356 Haynes, Teresa W. (ed.) et al., Structures of domination in graphs. Cham: Springer. Dev. Math. 66, 135-181 (2021). Reviewer: Venkatakrishnan Yanamandram (Tiruchirappalli) MSC: 05C69 PDFBibTeX XMLCite \textit{C. M. Mynhardt} and \textit{A. Roux}, Dev. Math. 66, 135--181 (2021; Zbl 1522.05356) Full Text: DOI
Blind, Sarah; Creignou, Nadia; Olive, Frédéric Locally definable vertex set properties are efficiently enumerable. (English) Zbl 1472.05069 Discrete Appl. Math. 303, 186-202 (2021). MSC: 05C30 05C38 05C20 PDFBibTeX XMLCite \textit{S. Blind} et al., Discrete Appl. Math. 303, 186--202 (2021; Zbl 1472.05069) Full Text: DOI
Monnot, Jérôme; Fernau, Henning; Manlove, David Algorithmic aspects of upper edge domination. (English) Zbl 1516.68070 Theor. Comput. Sci. 877, 46-57 (2021). MSC: 68R10 05C69 68Q17 68W25 PDFBibTeX XMLCite \textit{J. Monnot} et al., Theor. Comput. Sci. 877, 46--57 (2021; Zbl 1516.68070) Full Text: DOI
Chandrasekar, K. Raja; Saravanakumar, S. Open packing number for some classes of perfect graphs. (English) Zbl 1462.05154 Ural Math. J. 6, No. 2, 38-43 (2020). MSC: 05C17 05C70 PDFBibTeX XMLCite \textit{K. R. Chandrasekar} and \textit{S. Saravanakumar}, Ural Math. J. 6, No. 2, 38--43 (2020; Zbl 1462.05154) Full Text: DOI MNR
Arumugam, S.; Raja Chandrasekar, K. Linear time algorithm for dominator chromatic number of trestled graphs. (English) Zbl 1427.05084 Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950066, 8 p. (2019). MSC: 05C15 05C69 PDFBibTeX XMLCite \textit{S. Arumugam} and \textit{K. Raja Chandrasekar}, Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950066, 8 p. (2019; Zbl 1427.05084) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri Enumeration and maximum number of maximal irredundant sets for chordal graphs. (English) Zbl 1416.05267 Discrete Appl. Math. 265, 69-85 (2019). MSC: 05C85 05C30 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Discrete Appl. Math. 265, 69--85 (2019; Zbl 1416.05267) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Sayadi, Mohamed Yosri Enumeration of maximal irredundant sets for claw-free graphs. (English) Zbl 1409.05109 Theor. Comput. Sci. 754, 3-15 (2019). MSC: 05C30 05C85 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 754, 3--15 (2019; Zbl 1409.05109) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Sayadi, Mohamed Yosri Enumeration of maximal irredundant sets for claw-free graphs. (English) Zbl 1441.05015 Fotakis, Dimitris (ed.) et al., Algorithms and complexity. 10th international conference, CIAC 2017, Athens, Greece, May 24–26, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10236, 297-309 (2017). MSC: 05A15 05C30 05C85 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Lect. Notes Comput. Sci. 10236, 297--309 (2017; Zbl 1441.05015) Full Text: DOI
Binkele-Raible, Daniel; Brankovic, Ljiljana; Cygan, Marek; Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Pilipczuk, Marcin; Rossmanith, Peter; Wojtaszczyk, Jakub Onufry Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack. (English) Zbl 1225.05227 J. Discrete Algorithms 9, No. 3, 214-230 (2011). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{D. Binkele-Raible} et al., J. Discrete Algorithms 9, No. 3, 214--230 (2011; Zbl 1225.05227) Full Text: DOI
Lakshmanan, S. Aparna; Vijayakumar, A. The \(\langle t \rangle \)-property of some classes of graphs. (English) Zbl 1200.05191 Discrete Math. 309, No. 1, 259-263 (2009). MSC: 05C75 PDFBibTeX XMLCite \textit{S. A. Lakshmanan} and \textit{A. Vijayakumar}, Discrete Math. 309, No. 1, 259--263 (2009; Zbl 1200.05191) Full Text: DOI
Cockayne, E. J.; Favaron, O.; Finbow, S.; Mynhardt, C. M. Open irredundance and maximum degree in graphs. (English) Zbl 1207.05095 Discrete Math. 308, No. 23, 5358-5375 (2008). MSC: 05C35 05C69 PDFBibTeX XMLCite \textit{E. J. Cockayne} et al., Discrete Math. 308, No. 23, 5358--5375 (2008; Zbl 1207.05095) Full Text: DOI
Finbow, S. A lower bound for the CO-irredundance number of a graph. (English) Zbl 1075.05067 Discrete Math. 295, No. 1-3, 49-62 (2005). Reviewer: Ralph Faudree (Memphis) MSC: 05C69 05C55 05C35 PDFBibTeX XMLCite \textit{S. Finbow}, Discrete Math. 295, No. 1--3, 49--62 (2005; Zbl 1075.05067) Full Text: DOI
Downey, Rodney G.; Fellows, Michael R.; Raman, Venkatesh The complexity of irredundant sets parameterized by size. (English) Zbl 0948.68133 Discrete Appl. Math. 100, No. 3, 155-167 (2000). MSC: 68R10 05C69 PDFBibTeX XMLCite \textit{R. G. Downey} et al., Discrete Appl. Math. 100, No. 3, 155--167 (2000; Zbl 0948.68133) Full Text: DOI
Chang, Maw-Shang; Nagavamsi, P.; Pandu Rangan, C. Weighted irredundance of interval graphs. (English) Zbl 1078.05526 Inf. Process. Lett. 66, No. 2, 65-70 (1998). MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{M.-S. Chang} et al., Inf. Process. Lett. 66, No. 2, 65--70 (1998; Zbl 1078.05526) Full Text: DOI
Cockayne, E. J.; Hattingh, J. H.; Hedetniemi, S. M.; Hedetniemi, S. T.; McRae, A. A. Using maximality and minimality conditions to construct inequality chains. (English) Zbl 0887.05031 Discrete Math. 176, No. 1-3, 43-61 (1997). Reviewer: E.J.F.Primrose (Leicester) MSC: 05C35 PDFBibTeX XMLCite \textit{E. J. Cockayne} et al., Discrete Math. 176, No. 1--3, 43--61 (1997; Zbl 0887.05031) Full Text: DOI
Henning, Michael A. Irredundance perfect graphs. (English) Zbl 0832.05059 Discrete Math. 142, No. 1-3, 107-120 (1995). Reviewer: O.R.Oellermann (Killarney) MSC: 05C35 05C75 05C15 PDFBibTeX XMLCite \textit{M. A. Henning}, Discrete Math. 142, No. 1--3, 107--120 (1995; Zbl 0832.05059) Full Text: DOI
Cheston, Grant A.; Fricke, Gerd Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance. (English) Zbl 0815.05038 Discrete Appl. Math. 55, No. 3, 241-258 (1994). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C35 05C60 05C75 PDFBibTeX XMLCite \textit{G. A. Cheston} and \textit{G. Fricke}, Discrete Appl. Math. 55, No. 3, 241--258 (1994; Zbl 0815.05038) Full Text: DOI