Details

Fulereni : delo diplomskega seminarja
ID Mlinar, Ana (Author), ID Škrekovski, Riste (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (853,99 KB)
MD5: 2A3CC2D2C429BC71596629D8C6BA4575
PID: 20.500.12556/rul/3808e76b-3748-45a2-8b1b-df7c48411245

Language:Slovenian
Keywords:matematika, teorija grafov, fulerenski grafi, ciklična povezanost, popolno prirejanje, Hamiltonov cikel
Work type:Final seminar paper
Typology:2.11 - Undergraduate Thesis
Organization:FMF - Faculty of Mathematics and Physics
Place of publishing:Ljubljana
Publisher:[A. Mlinar]
Year:2011
Number of pages:28 str.
PID:20.500.12556/RUL-95830 This link opens in a new window
UDC:519.17
COBISS.SI-ID:16373849 This link opens in a new window
Publication date in RUL:19.10.2017
Views:4931
Downloads:456
Metadata:XML DC-XML DC-RDF
:
MLINAR, Ana, 2011, Fulereni : delo diplomskega seminarja [online]. Bachelor’s thesis. Ljubljana : A. Mlinar. [Accessed 16 March 2025]. Retrieved from: https://repozitorij.uni-lj.si/IzpisGradiva.php?lang=eng&id=95830
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Fullerenes
Keywords:mathematics, graph theory, fullerene graphs, cyclical connectivity, perfect matching, Hamilton cycle

Similar documents

Similar works from RUL:
  1. t-tonska barvanja
  2. Sebikomplementarni grafi
  3. Povezanost grafov
  4. Fulereni
Similar works from other Slovenian collections:
  1. How good can ants color graphs?
  2. 2-local 3/4-competitive algorithm for multicoloring hexagonal graphs
  3. Collins, Karen L.(1-WESL-C); Shemmer, Benjamin(1-WESL-C): Constructions of 3-colorable cores. (English summary). - SIAM J. Discrete Math. 16 (2002), no. 1,74--80 (electronic)
  4. 2-lokalen porazdeljeni algoritmi za posplošeno barvanje heksagonalnih grafov
  5. Aciklična barvanja direktnih produktov

Back