Using 2-colorings in the theory of uniquely Hamiltonian graphs
| dc.contributor.author | Zeps, Dainis | |
| dc.date.accessioned | 2019-03-03T20:09:46Z | |
| dc.date.accessioned | 2025-07-22T03:18:19Z | |
| dc.date.available | 2019-03-03T20:09:46Z | |
| dc.date.issued | 2019-02 | |
| dc.description.abstract | We 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 extractions | en_US |
| dc.identifier.uri | https://dspace.lu.lv/handle/7/46432 | |
| dc.language.iso | eng | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | graph theory, uniquely Hamiltonian graphs, Thomassen's conjecture | en_US |
| dc.title | Using 2-colorings in the theory of uniquely Hamiltonian graphs | en_US |
| dc.type | info:eu-repo/semantics/preprint | en_US |