11. Hamilton cycles in primitive vertex-transitive graphs of order a product of two primes - the case PSL(2, q[sup]2) acting on cosets of PGL(2, q)Shao Fei Du, Klavdija Kutnar, Dragan Marušič, 2020, izvirni znanstveni članek Opis: A step forward is made in a long standing Lovász problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes arising from the group action of the projective special linear group PSL▫$(2, q^2)$▫ on cosets of its subgroup isomorphic to the projective general linear group PGL$(2, q)$ contains a Hamilton cycle.
Ključne besede: vertex-transitive graph, Hamilton cycle, automorphism group, orbital graph
Objavljeno v RUP: 20.07.2020; Ogledov: 1351; Prenosov: 46
 Celotno besedilo (365,31 KB) |
12. Chandgotia, Nishant, Pak, Igor, Tassy, Martin: Kirszbraun-type theorems for graphs. (English summary). - J. Combin. Theory Ser. B 137 (2019), 10-24Safet Penjić, 2020, recenzija, prikaz knjige, kritika Ključne besede: G-Kirszbraun graphs, vertex-transitive graph, Kirszbraun theorem
Objavljeno v RUP: 16.04.2020; Ogledov: 1472; Prenosov: 20
 Povezava na celotno besedilo |
13. Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19Martin Milanič, 2019, predavanje na tuji univerzi Ključne besede: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Objavljeno v RUP: 03.09.2019; Ogledov: 1715; Prenosov: 16
Povezava na celotno besedilo |
14. On the end-vertex problem of graph searchesJesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler, 2019, izvirni znanstveni članek Ključne besede: end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph classes
Objavljeno v RUP: 22.08.2019; Ogledov: 1563; Prenosov: 47
Povezava na celotno besedilo |
15. Avoidable vertices and edges in graphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, objavljeni znanstveni prispevek na konferenci Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Objavljeno v RUP: 20.08.2019; Ogledov: 2015; Prenosov: 156
Povezava na celotno besedilo |
16. |
17. |
18. |
19. |
20. |
