Request file

Review/Citation:  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.
Requested document:  Pelant.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.

Fields marked with * are obligatory.

(Universities, research institutions, associations …)

Pelant.pdf

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.