Number of the records: 1
On complete strongly connected digraphs with the least number of 3-graphs
- 1.0174393 - MU-W 970058 RIV NL eng J - Journal Article
Pelant, Jan - Burzio, M.
On complete strongly connected digraphs with the least number of 3-graphs.
Discrete Mathematics. Roč. 155, - (1996), s. 27-30. ISSN 0012-365X. E-ISSN 1872-681X
R&D Projects: GA ČR GA201/97/0216
Impact factor: 0.271, year: 1996
Permanent Link: http://hdl.handle.net/11104/0071402
File Download Size Commentary Version Access Pelant.pdf 1 190.7 KB Publisher’s postprint require
Number of the records: 1