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

Recent

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.

Author: Thomassen remove
Filter results...

Interpreted as:

title:(The AND Erdos-Posa AND property AND for AND odd AND cycles AND in AND graphs AND of AND large AND connectivity)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
Previous 1 - 2 of 2 Next
Export
10 items by relevance
1 Report

The Erdos-Posa property for odd cycles in graphs of large connectivity

Thomassen, Carsten

Year: 1999

Language: English

More...
ngacp of jdleki hbm
2 Journal article

The Erdos-Posa property for odd cycles in graphs of large connectivity

Thomassen, Carsten

Combinatorica — 2001, Volume 21, Issue 2, pp. 321-333

obtain a result of Erdos-Posa type for odd cycles in graphs of large connectivity Also, every 2(3162)-connected graph contains a totally odd K-4-subdivision, that is, a subdivision of K-4 in which each edge of K-4 corresponds to an odd path, if and only if the deletion of any vertex leaves a nonbipartite

Year: 2001

Language: English

More...
ne abcmpl i kodgfjh

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

Log in as DTU user