Alahmadi, A.; Aldred, R. E. L.; Thomassen, C. Cycles in 5-connected triangulations. (English) Zbl 1430.05018 J. Comb. Theory, Ser. B 140, 27-44 (2020). MSC: 05C10 05C38 05C40 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., J. Comb. Theory, Ser. B 140, 27--44 (2020; Zbl 1430.05018) Full Text: DOI Link
Alahmadi, Adel; Aldred, Robert E. L.; Alkenani, Ahmad; Hijazi, Rola; Solé, Patrick; Thomassen, Carsten Extending a perfect matching to a Hamiltonian cycle. (English) Zbl 1311.05157 Discrete Math. Theor. Comput. Sci. 17, No. 1, 241-254 (2015). MSC: 05C70 05C45 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Discrete Math. Theor. Comput. Sci. 17, No. 1, 241--254 (2015; Zbl 1311.05157) Full Text: Link
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
Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Solé, P.; Thomassen, C. The maximum number of minimal codewords in an \([n,k]\)-code. (English) Zbl 1281.94099 Discrete Math. 313, No. 15, 1569-1574 (2013). MSC: 94B60 05B35 05C30 05C38 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Discrete Math. 313, No. 15, 1569--1574 (2013; Zbl 1281.94099) Full Text: DOI arXiv
Alahmadi, A.; Aldred, R. E. L.; dela Cruz, R.; Solé, P.; Thomassen, C. The maximum number of minimal codewords in long codes. (English) Zbl 1254.05084 Discrete Appl. Math. 161, No. 3, 424-429 (2013). MSC: 05C38 05C35 05B35 94B05 PDFBibTeX XMLCite \textit{A. Alahmadi} et al., Discrete Appl. Math. 161, No. 3, 424--429 (2013; Zbl 1254.05084) Full Text: DOI arXiv
Aldred, R. E. L.; Thomassen, Carsten On the maximum number of cycles in a planar graph. (English) Zbl 1140.05034 J. Graph Theory 57, No. 3, 255-264 (2008). Reviewer: Alain Bretto (Caen) MSC: 05C30 05C38 PDFBibTeX XMLCite \textit{R. E. L. Aldred} and \textit{C. Thomassen}, J. Graph Theory 57, No. 3, 255--264 (2008; Zbl 1140.05034) Full Text: DOI
Aldred, R. E. L.; Thomassen, Carsten Graphs with not all possible path-kernels. (English) Zbl 1066.05107 Discrete Math. 285, No. 1-3, 297-300 (2004). Reviewer: Erich Prisner (Sorengo-Lugano) MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{R. E. L. Aldred} and \textit{C. Thomassen}, Discrete Math. 285, No. 1--3, 297--300 (2004; Zbl 1066.05107) Full Text: DOI
Aldred, R. E. L.; Thomassen, Carsten On the number of cycles in 3-connected cubic graphs. (English) Zbl 0918.05068 J. Comb. Theory, Ser. B 71, No. 1, 79-84 (1997). Reviewer: Jörgen Bang-Jensen (Odense) MSC: 05C30 05C38 PDFBibTeX XMLCite \textit{R. E. L. Aldred} and \textit{C. Thomassen}, J. Comb. Theory, Ser. B 71, No. 1, 79--84 (1997; Zbl 0918.05068) Full Text: DOI
Aldred, R. E. L.; Holton, D. A.; Thomassen, C. Cycles through four edges in 3-connected cubic graphs. (English) Zbl 0717.05043 Graphs Comb. 1, 7-11 (1985). MSC: 05C38 PDFBibTeX XMLCite \textit{R. E. L. Aldred} et al., Graphs Comb. 1, 7--11 (1985; Zbl 0717.05043) Full Text: DOI