Number of the records: 1
An approximate version of the Tree Packing Conjecture
SYS 0454288 LBL 01000a^^22220027750^450 005 20240103211635.8 014 $a 84953281806 $2 SCOPUS 014 $a 000377265200017 $2 WOS 017 $a 10.1007/s11856-015-1277-2 $2 DOI 100 $a 20160111d m y slo 03 ba 101 $a eng $d eng 102 $a IL 200 1-
$a An approximate version of the Tree Packing Conjecture 215 $a 56 s. 300 $a NejPublikaceUI Soutez2016 VitezUI 463 -1
$1 001 cav_un_epca*0256832 $1 011 $a 0021-2172 $e 1565-8511 $1 200 1 $a Israel Journal of Mathematics $v Roč. 211, č. 1 (2016), s. 391-446 $1 210 $c Magnes press 610 $a Ringel's conjecture 610 $a Gyarfas-Lehel conjecture 610 $a Tree packing 700 -1
$3 cav_un_auth*0309063 $4 070 $a Böttcher $b J. $y GB 701 -1
$3 cav_un_auth*0309061 $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $4 070 $a Hladký $b Jan $p MU-W $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0315926 $i Oddělení teoretické informatiky $j Department of Theoretical Computer Science $w Department of Theoretical Computer Science $4 070 $a Piguet $b Diana $p UIVT-O $T Ústav informatiky AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0316708 $4 070 $a Taraz $b A. $y DE 856 $u http://link.springer.com/article/10.1007%2Fs11856-015-1277-2
Number of the records: 1