Number of the records: 1
Almost all trees are almost graceful
SYS 0524449 LBL 01000a^^22220027750^450 005 20240103224055.0 014 $a 85079856601 $2 SCOPUS 014 $a 000514232400001 $2 WOS 017 $a 10.1002/rsa.20906 $2 DOI 100 $a 20200521d m y slo 03 ba 101 $a eng $d eng 102 $a US 200 1-
$a Almost all trees are almost graceful 215 $a 40 s. 463 -1
$1 001 cav_un_epca*0257541 $1 011 $a 1042-9832 $e 1098-2418 $1 200 1 $a Random Structures and Algorithms $v Roč. 56, č. 4 (2020), s. 948-987 $1 210 $c Wiley 610 $a extremal graph theory 610 $a graceful tree labelling 610 $a tree 700 -1
$3 cav_un_auth*0392337 $a Adamaszek $b A. $y DK $4 070 701 -1
$3 cav_un_auth*0309060 $a Allen $b P. $y GB $4 070 701 -1
$3 cav_un_auth*0392338 $a Grosu $b C. $y CH $4 070 701 -1
$3 cav_un_auth*0309061 $a Hladký $b Jan $p MU-W $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $w Mathematical Logic and Theoretical Computer Science $y CZ $4 070 $z K $T Matematický ústav AV ČR, v. v. i. 856 $u https://doi.org/10.1002/rsa.20906 $9 RIV
Number of the records: 1