default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMateja Sajna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Mateja Sajna
, Andrew Wagner:
Using edge cuts to find Euler tours and Euler families in hypergraphs. Discret. Math. 346(10): 113537 (2023)- [j22]Mateja Sajna, Andrew Wagner:
ℓ-covering k-hypergraphs are quasi-eulerian. Discuss. Math. Graph Theory 43(4): 1091-1102 (2023) - 2022
- [j21]Mateja Sajna, Andrew Wagner:
Covering hypergraphs are Eulerian. J. Graph Theory 101(2): 226-241 (2022)
2010 – 2019
- 2019
- [i1]M. Amin Bahmanian, Mateja Sajna:
Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach. CoRR abs/1909.09644 (2019) - 2018
- [j20]Yan Steimle, Mateja Sajna:
Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts. Discret. Math. 341(10): 2808-2819 (2018) - 2017
- [j19]M. Amin Bahmanian, Mateja Sajna:
Quasi-Eulerian Hypergraphs. Electron. J. Comb. 24(3): 3 (2017) - 2015
- [j18]Mateja Sajna, Andrew Wagner:
On Sheehan's Conjecture for Graphs with Symmetry. J. Graph Theory 80(1): 43-57 (2015) - 2014
- [j17]Andrea C. Burgess, Mateja Sajna:
On the Directed Oberwolfach Problem with Equal Cycle Lengths. Electron. J. Comb. 21(1): 1 (2014) - 2013
- [j16]Patrick Niesink, Keven Poulin, Mateja Sajna:
Computing transitive closure of bipolar weighted digraphs. Discret. Appl. Math. 161(1-2): 217-243 (2013)
2000 – 2009
- 2009
- [j15]Primoz Potocnik, Mateja Sajna:
The existence of regular self-complementary 3-uniform hypergraphs. Discret. Math. 309(4): 950-954 (2009) - [j14]Nevena Francetic, Mateja Sajna:
More on almost self-complementary graphs. Discret. Math. 309(10): 3106-3112 (2009) - [j13]Primoz Potocnik, Mateja Sajna:
Vertex-transitive self-complementary uniform hypergraphs. Eur. J. Comb. 30(1): 327-337 (2009) - [j12]Primoz Potocnik, Mateja Sajna:
Brick assignments and homogeneously almost self-complementary graphs. J. Comb. Theory B 99(1): 185-201 (2009) - 2008
- [j11]Primoz Potocnik, Mateja Sajna:
A note on transitive permutation groups of degree twice a prime. Ars Math. Contemp. 1(2): 165-168 (2008) - 2007
- [j10]Primoz Potocnik, Mateja Sajna, Gabriel Verret:
Mobility of vertex-transitive graphs. Discret. Math. 307(3-5): 579-591 (2007) - [j9]Primoz Potocnik, Mateja Sajna:
Self-complementary two-graphs and almost self-complementary double covers. Eur. J. Comb. 28(6): 1561-1574 (2007) - 2006
- [j8]Primoz Potocnik, Mateja Sajna:
On almost self-complementary graphs. Discret. Math. 306(1): 107-123 (2006) - 2005
- [j7]Joy Morris, Mateja Sajna:
Brian Alspach and his work. Discret. Math. 299(1-3): 269-287 (2005) - [j6]Mateja Sajna, Primoz Potocnik:
Homogeneously almost self-complementary graphs. Electron. Notes Discret. Math. 22: 291-294 (2005) - 2004
- [j5]Edward Dobson, Mateja Sajna:
Almost self-complementary circulant graphs. Discret. Math. 278(1-3): 23-44 (2004) - 2003
- [j4]Brian Alspach, Heather Gavlas, Mateja Sajna, Helen Verrall:
Cycle decompositions IV: complete directed graphs and fixed length directed cycles. J. Comb. Theory A 103(1): 165-208 (2003) - 2002
- [j3]Mateja Sajna:
On decomposing Kn-I into cycles of a fixed odd length. Discret. Math. 244(1-3): 435-444 (2002) - 2000
- [j2]Mateja Sajna:
On the problem of a matching orthogonal to a 2-factorization. Discret. Math. 218(1-3): 277-282 (2000)
1990 – 1999
- 1998
- [j1]Mateja Sajna:
Half-transitivity of some metacirculants. Discret. Math. 185(1-3): 117-136 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
