default search action
Mariusz Meszka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j42]Mateusz Kamyczura
, Mariusz Meszka
A note on the conflict-free chromatic index. Discret. Math. 347(4): 113897 (2024) - [j41]Mariusz Meszka
The seating couples problem in the even case. Discret. Math. 347(11): 114182 (2024)
2010 – 2019
- 2019
- [j40]Mariusz Meszka, Alexander Rosa:
Cyclic and rotational six-cycle systems. Bull. ICA 87: 41-46 (2019) - [j39]Mariusz Meszka
Orthogonal one-factorizations of complete multipartite graphs. Des. Codes Cryptogr. 87(5): 987-993 (2019) - 2018
- [j38]Mariusz Meszka
Reaction graphs of double Fano planes. Art Discret. Appl. Math. 1(2): #P2.04 (2018) - [j37]Mariusz Meszka
New sufficient conditions for bipancyclicity of balanced bipartite digraphs. Discret. Math. 341(11): 3237-3240 (2018) - 2017
- [j36]Mariusz Meszka, Alexander Rosa, Beatrice Ruini:
Kite systems of order 8; embedding of kite systems into bowtie systems. Australas. J Comb. 67: 378-393 (2017) - [j35]Charles C. Lindner, Christopher A. Rodger, Mariusz Meszka:
Revisiting the intersection problem for minimum coverings of complete graphs with triples. Australas. J Comb. 68: 276-284 (2017) - [j34]Mariusz Meszka, Alexander Rosa:
A possible analogue of ρ-labellings for 3-uniform hypergraphs. Electron. Notes Discret. Math. 60: 33-37 (2017) - [j33]Mariusz Meszka
Maximal Edge-Colorings of Graphs. Graphs Comb. 33(6): 1451-1458 (2017) - 2016
- [j32]Mariusz Meszka, Roman Nedela, Alexander Rosa, Martin Skoviera:
Decompositions of complete graphs into circulants. Discret. Math. 339(10): 2471-2480 (2016) - 2015
- [j31]Mariusz Meszka, Alexander Rosa:
Cubic leaves. Australas. J Comb. 61: 114-129 (2015) - [j30]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Almost 2-perfect 6-cycle systems. Des. Codes Cryptogr. 77(2-3): 321-333 (2015) - 2014
- [j29]Mirko Hornák
Minimum Number of Palettes in Edge Colorings. Graphs Comb. 30(3): 619-626 (2014) - 2013
- [j28]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Palettes in block colourings of designs. Australas. J Comb. 56: 235-244 (2013) - [j27]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Triple metamorphosis of twofold triple systems. Discret. Math. 313(19): 1872-1883 (2013) - 2012
- [j26]Petr Kovár
Factorizations of complete graphs into brooms. Discret. Math. 312(6): 1084-1093 (2012) - [j25]Mariusz Meszka, Zdzislaw Skupien:
Decompositions of a complete multidigraph into almost arbitrary paths. Discuss. Math. Graph Theory 32(2): 357-372 (2012) - 2011
- [j24]Elizabeth J. Billington, Dean G. Hoffman, Charles C. Lindner, Mariusz Meszka:
Almost resolvable minimum coverings of complete graphs with 4-cycles. Australas. J Comb. 50: 73-86 (2011)
2000 – 2009
- 2009
- [j23]Mariusz Meszka, Alexander Rosa:
Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles. Australas. J Comb. 45: 291-302 (2009) - [j22]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
On (K4, K4-e)-Designs. Ars Comb. 93 (2009) - [j21]Mariusz Meszka:
k-Cycle Free One-Factorizations of Complete Graphs. Electron. J. Comb. 16(1) (2009) - [j20]Mariusz Meszka, Alexander Rosa, Irmina A. Ziolo:
Steiner almost self-complementary graphs and halving near-Steiner triple systems. Discret. Math. 309(18): 5650-5654 (2009) - [j19]Mariusz Meszka:
Preface. Discret. Math. 309(22): 6327 (2009) - [j18]Mariusz Meszka, Zdzislaw Skupien:
Decompositions of nearly complete digraphs into t isomorphic parts. Discuss. Math. Graph Theory 29(3): 563-572 (2009) - 2008
- [j17]Mariusz Meszka, Roman Nedela, Alexander Rosa:
The chromatic number of 5-valent circulants. Discret. Math. 308(24): 6269-6284 (2008) - [j16]Mariusz Meszka:
Solution to the problem of Kubesa. Discuss. Math. Graph Theory 28(2): 375-378 (2008) - 2007
- [j15]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments II. Australas. J Comb. 37: 57-66 (2007) - [j14]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments. Discret. Math. 307(7-8): 896-904 (2007) - [j13]Rafal Kalinowski, Mariusz Meszka:
Preface. Discret. Math. 307(11-12): 1221-1222 (2007) - [j12]Rafal Kalinowski, Mariusz Meszka:
Research Problems from the Fourth Cracow Conference (Czorsztyn, 2002). Discret. Math. 307(11-12): 1545-1549 (2007) - 2006
- [j11]Mariusz Meszka:
Preface. Electron. Notes Discret. Math. 24: 1 (2006) - [j10]Mariusz Meszka, Zdzislaw Skupien:
Decompositions of a complete multidigraph into nonhamiltonian paths. J. Graph Theory 51(1): 82-91 (2006) - 2004
- [j9]Mariusz Meszka, Alexander Rosa:
Embedding Steiner triple systems into Steiner systems S(2, 4, v). Discret. Math. 274(1-3): 199-212 (2004) - [j8]Zbigniew Lonc
Edge Decompositions of Multigraphs into 3-Matchings. Graphs Comb. 20(4): 507-515 (2004) - 2002
- [j7]Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decompositions of multigraphs into parts with two edges. Discuss. Math. Graph Theory 22(1): 113-121 (2002) - 2001
- [j6]Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda:
Preface. Discret. Math. 236(1-3): 1- (2001) - 2000
- [j5]Pavol Gvozdjak, Peter Horák, Mariusz Meszka, Zdzislaw Skupien:
On the Strong Chromatic Index of Cyclic Multigraphs. Discret. Appl. Math. 99(1-3): 23-38 (2000) - [j4]Mariusz Meszka, Zdzislaw Skupien:
On some third parts of nearly complete digraphs. Discret. Math. 212(1-2): 129-139 (2000)
1990 – 1999
- 1999
- [j3]Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decomposition of Multigraphs into Isomorphic Graphs with Two Edges. Ars Comb. 51 (1999) - 1998
- [j2]Mariusz Meszka, Zdzislaw Skupien:
Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs. Comb. 18(3): 413-424 (1998) - 1996
- [j1]Mariusz Meszka, Joanna Nowak, Zdenek Ryjácek, Bohdan Zelinka:
Hymn teorii grafów. Discuss. Math. Graph Theory 16(2): 219-223 (1996)
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-10-07 22:18 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: