Daži trīssakarīgi grafi un to saimes bez Hamiltona cikliem

dc.contributor.authorGrinbergs, Emanuels
dc.date.accessioned2013-12-17T14:31:51Z
dc.date.available2013-12-17T14:31:51Z
dc.date.issued2013-12-17
dc.description.abstractThese manuscripts (in Latvian) contain examples of graphs without Hamiltonian cycles. See the flower snark J5 on the page 13. The date here 1.6.78.en_US
dc.identifier.urihttps://dspace.lu.lv/dspace/handle/7/2190
dc.language.isolaven_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectcombinatorics, graph theory, flower snarksen_US
dc.subjectRokraksts
dc.titleDaži trīssakarīgi grafi un to saimes bez Hamiltona cikliemen_US
dc.title.alternativeSome threeconnected graphs and their families without Hamiltonian cycles
dc.typeinfo:eu-repo/semantics/otheren_US
dc.typeinfo:eu-repo/semantics/manuscript
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
grinb.ham.1.pdf
Size:
795.42 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: