LONG CYCLES IN DIAGRAPHSTHOMASSEN C.1981; PROC. LOND. MATH. SOC.; ISSN 0024-6115; GBR; DA. 1981; VOL. 42; NO 2; PP. 231-251; BIBL. 19 REF.Article

HAMILTONIAN-CONNECTED TOURNAMENTSTHOMASSEN C.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 2; PP. 142-163; BIBL. 13 REF.Article

TRANSVERSALS OF CIRCUITS IN THE LEXICOGRAPHIC PRODUCT OF DIRECTED GRAPHS.THOMASSEN C.1975; MATH. SCI. HUM.; FR.; DA. 1975; NO 51; PP. 43-45; BIBL. 2 REF.Article

ON HYPOHAMILTONIAN GRAPHS.THOMASSEN C.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 10; NO 3-4; PP. 383-390; BIBL. 13 REF.Article

GRAPH DECOMPOSITION WITH CONSTRAINTS ON THE CONNECTIVITY AND MINIMUM DEGREETHOMASSEN C.1983; JOURNAL OF GRAPH THEORY; ISSN 0364-9024; USA; DA. 1983; VOL. 7; NO 2; PP. 165-167; BIBL. 4 REF.Article

DUALITY OF INFINITE GRAPHSTHOMASSEN C.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 33; NO 2; PP. 137-160; BIBL. 14 REF.Article

ON SEPARATING CYCLES IN GRAPHS.THOMASSEN C.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 1; PP. 57-73; BIBL. 11 REF.Article

NOTE ON CIRCUITS CONTAINING SPECIFIED EDGES.THOMASSEN C.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 279-280; BIBL. 1 REF.Article

HYPOHAMILTONIAN AND HYPOCEABLE GRAPHS.THOMASSEN C.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 1; PP. 91-96; BIBL. 8 REF.Article

GRAPH DECOMPOSITION WITH APPLICATIONS TO SUBDIVISIONS AND PATH SYSTEMS MODULO KTHOMASSEN C.1983; JOURNAL OF GRAPH THEORY; ISSN 0364-9024; USA; DA. 1983; VOL. 7; NO 2; PP. 261-271; BIBL. 14 REF.Article

COUNTEREXAMPLES TO THE EDGE RECONSTRUCTION CONJECTURE FOR INFINITE GRAPHS.THOMASSEN C.1977; DISCRETE MATH.; NETHERL.; DA. 1977 PARU 1978; VOL. 19; NO 3; PP. 293-295; BIBL. 8 REF.Article

ON THE NUMBER OF HAMILTONIAN CYCLES IN TOURNAMENTSTHOMASSEN C.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 31; NO 3; PP. 315-323; BIBL. 9 REF.Article

PLANARITY AND DUALITY OF FINITE AND INFINITE GRAPHSTHOMASSEN C.1980; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1980; VOL. 29; NO 2; PP. 244-271; BIBL. 33 REF.Article

RECONSTRUCTIBILITY VERSUS EDGE RECONSTRUCTIBILITY OF INFINITE GRAPHSTHOMASSEN C.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 2; PP. 231-233; BIBL. 4 REF.Article

ON RANDOMLY HAMILTONIAN GRAPHSTHOMASSEN C.1973; MATH. ANN.; DTSCH.; DA. 1973; VOL. 200; NO 3; PP. 195-208; BIBL. 3 REF.Serial Issue

The Jordan-Schönflies theorem and the classification of surfacesTHOMASSEN, C.The American mathematical monthly. 1992, Vol 99, Num 2, pp 116-130, issn 0002-9890Article

Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surfaceTHOMASSEN, C.Transactions of the American Mathematical Society. 1991, Vol 323, Num 2, pp 605-635, issn 0002-9947Article

Whitney's 2-Switching theorem, cycle spaces, and arc mappings of directed graphsTHOMASSEN, C.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 3, pp 257-291, issn 0095-8956Article

Arc reversals in tournamentsTHOMASSEN, C.Discrete mathematics. 1988, Vol 71, Num 1, pp 73-86, issn 0012-365XArticle

Subdivisions of graphs with large minimum degreeTHOMASSEN, C.Journal of graph theory. 1984, Vol 8, Num 1, pp 23-28, issn 0364-9024Article

ANTICRITICAL GRAPHS.HARARY F; THOMASSEN C.1975; MATH. PROC. CAMBRIDGE PHILOS. SOC.; G.B.; DA. 1975; VOL. 79; NO 1; PP. 11-18; BIBL. 12 REF.Article

Triangulating a surface with a prescribed graphTHOMASSEN, C.Journal of combinatorial theory. Series B. 1993, Vol 57, Num 2, pp 196-206, issn 0095-8956Article

Infinite connected graphs with no end-preserving spanning treesTHOMASSEN, C.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 322-324, issn 0095-8956Article

Highly connected non-2-linked digraphsTHOMASSEN, C.Combinatorica (Print). 1991, Vol 11, Num 4, pp 393-395, issn 0209-9683Article

On the presence of disjoint subgraphs of a specified typeTHOMASSEN, C.Journal of graph theory. 1988, Vol 12, Num 1, pp 101-111, issn 0364-9024Article