I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Decomposing highly edge-connected graphs into paths of any ..:
Botler, Fabio
;
Mota, Guilherme O
;
Oshiro, Marcio T. I
.
http://arxiv.org/abs/1509.06393. , 2015
Link:
http://arxiv.org/abs/1509.06393
RT Journal T1
Decomposing highly edge-connected graphs into paths of any given length
UL https://suche.suub.uni-bremen.de/peid=base-ftarxivpreprints:oai:arXiv.org:1509.06393&Exemplar=1&LAN=DE A1 Botler, Fabio A1 Mota, Guilherme O A1 Oshiro, Marcio T. I A1 Wakabayashi, Yoshiko YR 2015 K1 Mathematics - Combinatorics K1 05B40 K1 05C70 K1 05C51 K1 05C38 K1 05C40 JF http://arxiv.org/abs/1509.06393 LK http://arxiv.org/abs/1509.06393 DO http://arxiv.org/abs/1509.06393 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)