Using 2-colorings in the theory of uniquely Hamiltonian graphs

Simple item page
dc.contributor.authorZeps, Dainis
dc.contributor.author
dc.date.accessioned2019-03-03T20:09:46Z
dc.date.available2019-03-03T20:09:46Z
dc.date.issued2019-02
dc.description.abstractWe use the concept of 2-coloring in analyzing UH3 graphs and building exact specifications of functions to find new UH3 graphs by Hamiltonian cycle edge extractionsen_US
dc.identifier.urihttps://dspace.lu.lv/dspace/handle/7/46432
dc.language.isoengen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectgraph theory, uniquely Hamiltonian graphs, Thomassen's conjectureen_US
dc.titleUsing 2-colorings in the theory of uniquely Hamiltonian graphsen_US
dc.typeinfo:eu-repo/semantics/preprinten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
two.coloring.pdf
Size:
397.54 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Preprinti (MII) / Preprints