On complete strongly connected digraphs with the least number of 3-graphs

Number of the records: 1

SYSNO	0174393
Title	On complete strongly connected digraphs with the least number of 3-graphs
Author(s)	Pelant, Jan (MU-W)_SAI Burzio, M. (IT)
Source Title	Discrete Mathematics. Roč. 155, - (1996), s. 27-30. - : Elsevier
Document Type	Článek v odborném periodiku
Grant	GA201/97/0216 GA ČR - Czech Science Foundation (CSF)
Language	eng
Country	NL
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