Number of the records: 1
On complete strongly connected digraphs with the least number of 3-graphs
SYS 0174393 LBL 00000nam^^22^^^^^^^^450 005 20240103175159.3 101 0-
$a eng 102 $a NL 200 1-
$a On complete strongly connected digraphs with the least number of 3-graphs 463 -1
$1 001 cav_un_epca*0256498 $1 011 $a 0012-365X $e 1872-681X $1 200 1 $a Discrete Mathematics $v Roč. 155, - (1996), s. 27-30 $1 210 $c Elsevier 700 -1
$3 cav_un_auth*0100691 $a Pelant $b Jan $p MU-W $4 070 $T Matematický ústav AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0079724 $a Burzio $b M. $y IT $4 070
Number of the records: 1