BibCzechLing: Nebeský, Ladislav - On the set of all shortest paths of a given length in a connected graph

The "Bibliography of the Czech Linguistics (BibCzechLing)" is provided by the Institute of the Czech Language of the Academy of Sciences of the Czech Republic (Ústav pro jazyk český AV). The database contains about 73.280 records and covers the period from 1992 till 2018. The list of subjects is located here.

ID	1996CZ046972
Author(s)	Nebeský, Ladislav
Title	On the set of all shortest paths of a given length in a connected graph
Published	Czechoslovak Mathematical Journal (Praha), 46 (121), 1996, s. 155-160
Language	eng
Classification (CZ)	Algebraická lingvistika
Classification (EN)	Algebraic linguistics
Subjects	lingvistika matematická
Note	Podle sb. Kapitoly z dějin..., 2007, s. 462
Medium	article
Source	https://bibliografie.ujc.cas.cz/documents/46972
PURL	Citation link

	On word length, clause length and sentence length in Bulgarian / Uhlířová, Ludmila
	Set a sada / Šaur, Vladimír
	Japanese Given Names. A Widow Into Contemporary Japanese Society / Barešová, Ivona
	Cognitive Paths into the Slavic Domain
	Language is neither all chaos nor all order / Daneš, František
	Psycholinguistics as a multidisciplinarily connected science. Proceedings of the 4th ISAPL international congress
	Length vs. order: word length and clause length from the perspective of word order / Uhlířová, Ludmila