# Carsten Thomassen

Ontology type: schema:Person

NAME

Carsten

SURNAME

Thomassen

### Publications in SciGraph latest 50 shown

• 2017-10 Nash-Williams’ cycle-decomposition theorem in COMBINATORICA
• 2017-10 Spanning quadrangulations of triangulated surfaces in ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITÄT HAMBURG
• 2017-08 Infinitely connected subgraphs in graphs of uncountable chromatic number in COMBINATORICA
• 2016-11 Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity in GRAPHS AND COMBINATORICS
• 2016-10 Orientations of infinite graphs with prescribed edge-connectivity in COMBINATORICA
• 2014-04 Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces” in COMBINATORICA
• 2013-02 Decomposing graphs into paths of fixed length in COMBINATORICA
• 2011-05 On planarity of compact, locally connected, metric spaces in COMBINATORICA
• 2008-09 Graph-like continua, augmenting arcs, and Menger’s theorem in COMBINATORICA
• 2008-06 Edge-decompositions of highly connected graphs into paths in ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITÄT HAMBURG
• 2007-03 On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree in COMBINATORICA
• 2007 On the Complexity of Some Colorful Problems Parameterized by Treewidth in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
• 2006-04 Density Conditions For Triangles In Multipartite Graphs in COMBINATORICA
• 2004-12 Classification Of Locally 2-Connected Compact Metric Spaces in COMBINATORICA
• 2004-09 The Locally Connected Compact Metric Spaces Embeddable In The Plane in COMBINATORICA
• 2002-10 On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree in COMBINATORICA
• 2001-07 Totally Odd \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}\end{document}-subdivisions in 4-chromatic Graphs in COMBINATORICA
• 2001-04 The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity in COMBINATORICA
• 1995-03 Intersections of curve systems and the crossing number ofC5×C5 in DISCRETE & COMPUTATIONAL GEOMETRY
• 1992-12 The Hadwiger number of infinite vertex-transitive graphs in COMBINATORICA
• 1992 Trees, Ends, and Transience in HARMONIC ANALYSIS AND DISCRETE POTENTIAL THEORY
• 1991-12 Highly connected non-2-linked digraphs in COMBINATORICA
• 1989-12 Planar acyclic oriented graphs in ORDER
• 1989-10 The coverse of the Jordan Curve Theorem and a characterization of planar maps in GEOMETRIAE DEDICATA
• 1987-12 Hamiltonian dicycles avoiding prescribed arcs in tournaments in GRAPHS AND COMBINATORICS
• 1987-03 On digraphs with no two disjoint directed cycles in COMBINATORICA
• 1985-12 Subgraphs with large degrees and girth in GRAPHS AND COMBINATORICS
• 1985-12 Cycles through four edges in 3-connected cubic graphs in GRAPHS AND COMBINATORICS
• 1983-03 Cycles in graphs of uncountable chromatic number in COMBINATORICA
• 1982-03 A nine point theorem for 3-connected graphs in COMBINATORICA
• 1973-03 Graphs in which every finite path is contained in a circuit in MATHEMATISCHE ANNALEN

### Identifiers

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service:

[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"affiliation": [
{
"affiliation": {
"id": "https://www.grid.ac/institutes/grid.5170.3",
"type": "Organization"
},
"isCurrent": true,
"type": "OrganizationRole"
}
],
"familyName": "Thomassen",
"givenName": "Carsten",
"id": "sg:person.011431216645.38",
"identifier": {
"name": "orcid_id",
"type": "PropertyValue",
"value": [
"0000-0003-0670-4079"
]
},
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011431216645.38",
"https://orcid.org/0000-0003-0670-4079"
],
"sdDataset": "persons",
"sdDatePublished": "2019-03-07T13:47",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1563.json",
"type": "Person"
}
]

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.011431216645.38'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.011431216645.38'

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.011431216645.38'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.011431216645.38'