Mateja Šajna

From MaRDI portal
Person:405088

Available identifiers

zbMath Open sajna.matejaWikidataQ102191087 ScholiaQ102191087MaRDI QIDQ405088

List of research outcomes





PublicationDate of PublicationType
Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment2024-02-05Paper
On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles2023-11-09Paper
Covering hypergraphs are Eulerian2023-10-05Paper
The directed Oberwolfach problem with variable cycle lengths: a recursive construction2023-09-21Paper
Using edge cuts to find Euler tours and Euler families in hypergraphs2023-07-19Paper
$\ell$-covering $k$-hypergraphs are quasi-eulerian2021-01-26Paper
On the Directed Oberwolfach Problem with variable cycle lengths2020-09-18Paper
On the honeymoon Oberwolfach problem2019-12-12Paper
Connection and separation in hypergraphs2019-07-22Paper
On the spouse‐loving variant of the Oberwolfach problem2019-07-19Paper
On the directed Oberwolfach Problem with equal cycle lengths: the odd case2019-01-30Paper
Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts2018-08-15Paper
Quasi-Eulerian hypergraphs2017-09-08Paper
Triple Systems are Eulerian2017-05-26Paper
Eulerian properties of hypergraphs2016-08-02Paper
Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach2016-05-06Paper
On Sheehan's Conjecture for Graphs with Symmetry2015-09-29Paper
Hypergraphs: connection and separation2015-04-16Paper
On the directed Oberwolfach problem with equal cycle lengths2014-09-04Paper
Computing transitive closure of bipolar weighted digraphs2012-11-22Paper
Closed trail decompositions of complete equipartite graphs2010-07-13Paper
More on almost self-complementary graphs2009-06-23Paper
The existence of regular self-complementary 3-uniform hypergraphs2009-04-09Paper
Vertex-transitive self-complementary uniform hypergraphs2009-01-27Paper
Brick assignments and homogeneously almost self-complementary graphs2009-01-21Paper
A note on transitive permutation groups of degree twice a prime2009-01-09Paper
Self-complementary two-graphs and almost self-complementary double covers2007-07-27Paper
Homogeneously almost self-complementary graphs2007-05-29Paper
Mobility of vertex-transitive graphs2007-02-13Paper
On almost self-complementary graphs2006-03-20Paper
Brian Alspach and his work2005-10-10Paper
Almost self-complementary circulant graphs.2004-03-14Paper
Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles2003-07-30Paper
Decomposition of the complete graph plus a 1‐factor into cycles of equal length2003-05-22Paper
Cycle decompositions. III: Complete graphs and fixed length cycles.2002-10-17Paper
On decomposing \(K_n -I\) into cycles of a fixed odd length2002-05-21Paper
Half-transitivity of some metacirculants2000-11-02Paper
On the problem of a matching orthogonal to a 2-factorization2000-09-15Paper

Research outcomes over time

This page was built for person: Mateja Šajna