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

Decompositions of highly connected graphs into paths of length 3

By Thomassen, Carsten1,2

From

Discrete mathematics, Department of Mathematics, Technical University of Denmark1

Department of Mathematics, Technical University of Denmark2

We prove that a 171-edge-connected graph has an edge-decomposition into paths of length 3 if and only its size is divisible by 3. It is a long-standing problem whether 2-edge-connectedness is sufficient for planar triangle-free graphs, and whether 3-edge-connectedness suffices for graphs in general. © 2008 Wiley Periodicals, Inc.

J Graph Theory 58: 286–292, 2008

Language: English
Publisher: Wiley Subscription Services, Inc., A Wiley Company
Year: 2008
Pages: 286-292
ISSN: 10970118 and 03649024
Types: Journal article
DOI: 10.1002/jgt.20311
ORCIDs: Thomassen, Carsten

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

Log in as DTU user

Access

Analysis