Record link: 
http://hdl.handle.net/20.500.12708/156011
-
Title: 
Almost Every Tree With m Edges Decomposes K₂ₘ,₂ₘ
en
Citation: 
DRMOTA, M., & LLADÓ, A. (2014). Almost Every Tree With m Edges Decomposes K₂ₘ,₂ₘ. Combinatorics, Probability and Computing, 23(1), 50–65. https://doi.org/10.1017/s0963548313000485
-
Publisher DOI: 
10.1017/s0963548313000485
-
Publication Type: 
Article - Original Research Article
en
Language: 
English
-
Authors: 
DRMOTA, M. 
LLADÓ, A. 
-
Organisational Unit: 
E104-05 - Forschungsbereich Kombinatorik und Algorithmen 
-
Journal: 
Combinatorics, Probability and Computing 
-
ISSN: 
0963-5483
-
Date (published): 
2014
-
Number of Pages: 
16
-
Peer reviewed: 
Yes
-
Keywords: 
Applied Mathematics; Theoretical Computer Science; Computational Theory and Mathematics; Statistics and Probability
-
Research Areas: 
außerhalb der gesamtuniversitären Forschungsschwerpunkte: 100%
-
Science Branch: 
Mathematik
-
Appears in Collections:
Article

Show full item record

Page view(s)

66
checked on Dec 1, 2023

Google ScholarTM

Check