Tilley, J. A. The \(a\)-graph coloring problem. (English) Zbl 1358.05119 Discrete Appl. Math. 217, Part 2, 304-317 (2017). MSC: 05C15 PDFBibTeX XMLCite \textit{J. A. Tilley}, Discrete Appl. Math. 217, Part 2, 304--317 (2017; Zbl 1358.05119) Full Text: DOI arXiv
Berry, Anne; Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. (English) Zbl 1311.05182 Discrete Appl. Math. 184, 50-61 (2015). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{A. Berry} et al., Discrete Appl. Math. 184, 50--61 (2015; Zbl 1311.05182) Full Text: DOI
Kim, Suh-Ryung; Lee, Jung Yeun; Park, Boram; Sano, Yoshio A generalization of Opsut’s result on the competition numbers of line graphs. (English) Zbl 1304.05116 Discrete Appl. Math. 181, 152-159 (2015). MSC: 05C76 PDFBibTeX XMLCite \textit{S.-R. Kim} et al., Discrete Appl. Math. 181, 152--159 (2015; Zbl 1304.05116) Full Text: DOI
Tian, Yingzhi; Meng, Jixiang; Zhang, Zhao On the connectivity of \(p\)-diamond-free vertex transitive graphs. (English) Zbl 1242.05148 Discrete Appl. Math. 160, No. 7-8, 1285-1290 (2012). MSC: 05C40 PDFBibTeX XMLCite \textit{Y. Tian} et al., Discrete Appl. Math. 160, No. 7--8, 1285--1290 (2012; Zbl 1242.05148) Full Text: DOI
Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences. (English) Zbl 1236.05127 Discrete Appl. Math. 160, No. 4-5, 471-478 (2012). MSC: 05C51 05C17 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 160, No. 4--5, 471--478 (2012; Zbl 1236.05127) Full Text: DOI
Guo, Jun-Lin; Wang, Tao-Ming; Wang, Yue-Li Unique intersectability of diamond-free graphs. (English) Zbl 1228.05216 Discrete Appl. Math. 159, No. 8, 774-778 (2011). MSC: 05C62 PDFBibTeX XMLCite \textit{J.-L. Guo} et al., Discrete Appl. Math. 159, No. 8, 774--778 (2011; Zbl 1228.05216) Full Text: DOI
Eschen, Elaine M.; Hoàng, Chính T.; Spinrad, Jeremy P.; Sritharan, R. On graphs without a \(C_{4}\) or a diamond. (English) Zbl 1213.05244 Discrete Appl. Math. 159, No. 7, 581-587 (2011). MSC: 05C85 PDFBibTeX XMLCite \textit{E. M. Eschen} et al., Discrete Appl. Math. 159, No. 7, 581--587 (2011; Zbl 1213.05244) Full Text: DOI
Dankelmann, Peter; Hellwig, Angelika; Volkmann, Lutz On the connectivity of diamond-free graphs. (English) Zbl 1126.05064 Discrete Appl. Math. 155, No. 16, 2111-2117 (2007). Reviewer: Ludovit Niepel (Safat) MSC: 05C40 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Discrete Appl. Math. 155, No. 16, 2111--2117 (2007; Zbl 1126.05064) Full Text: DOI
Brandstädt, Andreas (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (English) Zbl 1175.90395 Discrete Appl. Math. 138, No. 1-2, 13-27 (2004). MSC: 90C35 05C85 03B15 PDFBibTeX XMLCite \textit{A. Brandstädt}, Discrete Appl. Math. 138, No. 1--2, 13--27 (2004; Zbl 1175.90395) Full Text: DOI