• English
    • Latviešu
    • Deutsch
    • русский
  • Help
  • English 
    • English
    • Latviešu
    • Deutsch
    • русский
  • Login
View Item 
  •   DSpace Home
  • B6 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science
  • Preprinti (MII) / Preprints
  • View Item
  •   DSpace Home
  • B6 – LU institūti un aģentūras / Institutes and agencies of the UL
  • Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science
  • Preprinti (MII) / Preprints
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Using 2-colorings in the theory of uniquely Hamiltonian graphs

Thumbnail
View/Open
two.coloring.pdf (397.5Kb)
Author
Zeps, Dainis
Date
2019-02
Metadata
Show full item record
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
URI
https://dspace.lu.lv/dspace/handle/7/46432
Collections
  • Preprinti (MII) / Preprints [12]

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

View Usage Statistics

University of Latvia
Contact Us | Send Feedback
Theme by 
@mire NV