Thomassen, Carsten Infinitely connected subgraphs in graphs of uncountable chromatic number. (English) Zbl 1413.05124 Combinatorica 37, No. 4, 785-793 (2017). MSC: 05C15 05C40 05C63 05C30 PDFBibTeX XMLCite \textit{C. Thomassen}, Combinatorica 37, No. 4, 785--793 (2017; Zbl 1413.05124) Full Text: DOI Link
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten On the complexity of some colorful problems parameterized by treewidth. (English) Zbl 1223.05070 Inf. Comput. 209, No. 2, 143-153 (2011). MSC: 05C15 PDFBibTeX XMLCite \textit{M. R. Fellows} et al., Inf. Comput. 209, No. 2, 143--153 (2011; Zbl 1223.05070) Full Text: DOI Link
Thomassen, Carsten Girth in graphs. (English) Zbl 0537.05034 J. Comb. Theory, Ser. B 35, 129-141 (1983). Reviewer: H.A. Jung MSC: 05C38 05C40 PDFBibTeX XMLCite \textit{C. Thomassen}, J. Comb. Theory, Ser. B 35, 129--141 (1983; Zbl 0537.05034) Full Text: DOI
Thomassen, Carsten Disjoint cycles in digraphs. (English) Zbl 0527.05036 Combinatorica 3, 393-396 (1983). MSC: 05C20 05C35 05C38 PDFBibTeX XMLCite \textit{C. Thomassen}, Combinatorica 3, 393--396 (1983; Zbl 0527.05036) Full Text: DOI
Thomassen, Carsten Cycles in graphs of uncountable chromatic number. (English) Zbl 0523.05046 Combinatorica 3, 133-134 (1983). MSC: 05C38 05C15 PDFBibTeX XMLCite \textit{C. Thomassen}, Combinatorica 3, 133--134 (1983; Zbl 0523.05046) Full Text: DOI
Bollobás, Béla; Thomassen, Carsten The size of connected hypergraphs with prescribed covering number. (English) Zbl 0483.05052 J. Comb. Theory, Ser. B 31, 150-155 (1981). MSC: 05C65 05C70 05A05 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{C. Thomassen}, J. Comb. Theory, Ser. B 31, 150--155 (1981; Zbl 0483.05052) Full Text: DOI