Mateja Šajna's
Publications
- Burgess,
Andrea; Šajna,
Mateja Closed trail
decompositions of complete equipartite graphs.
J. Combin. Des.
17
(2009),
no. 5, 374–403.
-
Francetić,
Nevena; Šajna,
Mateja More on almost
self-complementary graphs.
Discrete Math.
309
(2009),
no. 10, 3106–3112.
-
Potočnik,
Primož; Šajna,
Mateja The existence of regular
self-complementary 3-uniform hypergraphs.
Discrete Math.
309
(2009),
no. 4, 950–954
- Potočnik,
Primož; Šajna,
Mateja Brick assignments and
homogeneously almost self-complementary groups.
J. Combin. Theory Ser. B
99
(2009),
no. 1, 185–201.
- Potočnik,
Primož; Šajna,
Mateja Vertex-transitive
self-complementary uniform hypergraphs.
European J. Combin.
30
(2009),
no. 1, 327–337.
- Potočnik,
Primož; Šajna,
Mateja A note on transitive
permutation groups of degree twice a prime.
Ars Math. Contemp.
1
(2008),
no. 2, 165–168.
- Potočnik,
Primož; Šajna,
Mateja Self-complementary
two-graphs and almost self-complementary double covers.
European J. Combin.
28
(2007),
no. 6, 1561–1574.
-
Potočnik,
Primož; Šajna,
Mateja; Verret,
Gabriel Mobility of
vertex-transitive graphs.
Discrete Math.
307
(2007),
no. 3-5, 579–591.
- Potočnik,
Primož; Šajna,
Mateja On almost
self-complementary graphs.
Discrete Math.
306
(2006),
no. 1, 107–123.
- Morris,
Joy; Šajna,
Mateja Brian Alspach and his
work.
Discrete Math.
299
(2005),
no. 1-3, 269–287.
- Dobson,
Edward; Šajna,
Mateja Almost self-complementary
circulant graphs.
Discrete Math.
278
(2004),
no. 1-3, 23–44.
- Alspach,
Brian; Gavlas,
Heather; Šajna,
Mateja; Verrall,
Helen Cycle decompositions. IV.
Complete directed graphs and fixed length directed cycles.
J. Combin. Theory Ser. A
103
(2003),
no. 1, 165–208.
-
Šajna,
Mateja Decomposition of the
complete graph plus a 1-factor into cycles of equal
length.
J. Combin. Des.
11
(2003),
no. 3, 170–207.
- Šajna,
Mateja On decomposing Kn−I
into cycles of a fixed odd length.
Algebraic and topological methods in graph theory (Lake
Bled, 1999).
Discrete Math.
244
(2002),
no. 1-3, 435–444.
-
Šajna,
Mateja Cycle decompositions. III.
Complete graphs and fixed length cycles.
J. Combin. Des.
10
(2002),
no. 1, 27–78.
-
Šajna,
Mateja On the problem of a
matching orthogonal to a 2-factorization.
Discrete Math.
218
(2000),
no. 1-3, 277–282.
-
Sajna, Mateja; Cycle decompositions of
K(n) and K(n)- I.
Thesis (Ph.D.)–Simon Fraser University (Canada). 1999. 154
pp.
- Šajna,
Mateja Half-transitivity of some
metacirculants.
Discrete Math.
185
(1998),
no. 1-3, 117–136.