Kurz, Sascha On the number of minimal codewords in codes generated by the adjacency matrix of a graph. (English) Zbl 1501.94089 Discrete Appl. Math. 309, 221-228 (2022). Reviewer: Tsuyoshi Miezaki (Tokyo) MSC: 94B05 05C50 PDFBibTeX XMLCite \textit{S. Kurz}, Discrete Appl. Math. 309, 221--228 (2022; Zbl 1501.94089) Full Text: DOI arXiv Link
Brandt, Felix; Harrenstein, Paul; Seedig, Hans Georg Minimal extending sets in tournaments. (English) Zbl 1397.91185 Math. Soc. Sci. 87, 55-63 (2017). MSC: 91B14 05C20 PDFBibTeX XMLCite \textit{F. Brandt} et al., Math. Soc. Sci. 87, 55--63 (2017; Zbl 1397.91185) Full Text: DOI
Brandt, Felix; Dau, Andre; Seedig, Hans Georg Bounds on the disparity and separation of tournament solutions. (English) Zbl 1315.05064 Discrete Appl. Math. 187, 41-49 (2015). MSC: 05C20 PDFBibTeX XMLCite \textit{F. Brandt} et al., Discrete Appl. Math. 187, 41--49 (2015; Zbl 1315.05064) Full Text: DOI
Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Ok, S.; Solé, P.; Thomassen, C. The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes. (English) Zbl 1311.05027 Discrete Appl. Math. 184, 32-39 (2015). MSC: 05B35 94B25 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Discrete Appl. Math. 184, 32--39 (2015; Zbl 1311.05027) Full Text: DOI
García-López, J.; Marijuán, C. Minimal strong digraphs. (English) Zbl 1238.05105 Discrete Math. 312, No. 4, 737-744 (2012). MSC: 05C20 05C40 05C85 PDFBibTeX XMLCite \textit{J. García-López} and \textit{C. Marijuán}, Discrete Math. 312, No. 4, 737--744 (2012; Zbl 1238.05105) Full Text: DOI arXiv