Number of the records: 1
On complete strongly connected digraphs with the least number of 3-graphs
- 1.PELANT, Jan, BURZIO, M. On complete strongly connected digraphs with the least number of 3-graphs. Discrete Mathematics. 1996, 155(-), 27-30. ISSN 0012-365X. E-ISSN 1872-681X.
Number of the records: 1