On the set of all shortest paths of a given length in a connected graph

Nebeský, Ladislav,

Dnes vráceno

Back to searched Previous Next

Documents for download

Show attached files
{{file.name}}

Record management

Edit Attached files

End catalogization

Mark as uncatalogued

z {{recordHolding.department | loc}}

z {{recordHolding.department | loc}}

Try to re-lookup for cover

Delete cover

Upload cover

History of searched expressions

Help and tutorial

Attributions

System developed by KP-SYS

System version {{$ctrl.portaroVersion.date | date:'d.M.yyyy H:mm:ss'}} ({{$ctrl.portaroVersion.branch}} {{$ctrl.portaroVersion.value}})

Česky
Deutsch

Login