About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit
Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

More...

Journal article

Deciding parity of graph crossing number

By Hliněný, Petr1; Thomassen, Carsten2,3

From

Masaryk University1

Department of Applied Mathematics and Computer Science, Technical University of Denmark2

Algorithms and Logic, Department of Applied Mathematics and Computer Science, Technical University of Denmark3

We prove that it is NP-hard to determine whether the crossing number of an input graph is even or odd.

Language: English
Publisher: Society for Industrial and Applied Mathematics
Year: 2018
Pages: 1962-1965
ISSN: 10957146 and 08954801
Types: Journal article
DOI: 10.1137/17M1137231
ORCIDs: Thomassen, Carsten
Keywords

Crossing number Graph NP-hardness

Other keywords

05C10 68Q25 68R10 crossing number graph

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis