default search action
Mariusz Grech
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j22]Mariusz Grech, Andrzej Kisielewicz:
Distinguishing index of graphs with simple automorphism groups. Eur. J. Comb. 99: 103414 (2022) - [j21]Mariusz Grech, Andrzej Kisielewicz:
Asymmetric edge-colorings of graphs with three colors. Eur. J. Comb. 106: 103526 (2022) - [j20]Mariusz Grech
, Andrzej Kisielewicz:
Wreath product in automorphism groups of graphs. J. Graph Theory 101(1): 29-51 (2022) - 2021
- [j19]Mariusz Grech:
Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups. Ars Math. Contemp. 21(2) (2021) - 2020
- [j18]Mariusz Grech
Graphical representations of cyclic permutation groups. Discret. Appl. Math. 277: 172-179 (2020) - [j17]Mariusz Grech
Synchronizing sequences for road colored digraphs. Discret. Appl. Math. 285: 128-140 (2020)
2010 – 2019
- 2019
- [j16]Mariusz Grech
Direct product of automorphism groups of digraphs. Ars Math. Contemp. 17(1): 89-101 (2019) - [j15]Mariusz Grech
Cyclic Permutation Groups that are Automorphism Groups of Graphs. Graphs Comb. 35(6): 1405-1432 (2019) - 2018
- [j14]Mariusz Grech
Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs. Electron. Notes Discret. Math. 68: 41-46 (2018) - [j13]Mariusz Grech
2-closed abelian permutation groups. Electron. Notes Discret. Math. 68: 83-88 (2018) - 2016
- [j12]Mariusz Grech
Černý conjecture for edge-colored digraphs with few junctions. Electron. Notes Discret. Math. 54: 115-120 (2016) - 2014
- [j11]Mariusz Grech
Graphical cyclic permutation groups. Discret. Math. 337: 25-33 (2014) - [j10]Mariusz Grech
Symmetry groups of boolean functions. Eur. J. Comb. 40: 1-10 (2014) - 2013
- [j9]Mariusz Grech
All totally symmetric colored graphs. Discret. Math. Theor. Comput. Sci. 15(1): 133-146 (2013) - [j8]Mariusz Grech
The Černý conjecture for automata respecting intervals of a directed graph. Discret. Math. Theor. Comput. Sci. 15(3): 61-72 (2013) - 2012
- [i1]Mariusz Grech, Andrzej Kisielewicz:
The Cerny conjecture for automata respecting intervals of a directed graph. CoRR abs/1207.2556 (2012) - 2011
- [j7]Mariusz Grech
The graphical complexity of direct products of permutation groups. J. Graph Theory 66(4): 303-318 (2011) - 2010
- [j6]Mariusz Grech
Regular symmetric groups of boolean functions. Discret. Math. 310(21): 2877-2882 (2010)
2000 – 2009
- 2009
- [j5]Mariusz Grech
Direct products of automorphism groups of graphs. J. Graph Theory 62(1): 26-36 (2009) - [j4]Mariusz Grech
Totally symmetric colored graphs. J. Graph Theory 62(4): 329-345 (2009) - 2008
- [j3]Mariusz Grech
Graphical complexity of products of permutation groups. Discret. Math. 308(7): 1142-1152 (2008) - 2007
- [j2]Mariusz Grech
Well- and Better-Quasi-Orderings in the Lattice of Varieties of Commutative Semigroups. Int. J. Algebra Comput. 17(4): 869-879 (2007) - 2004
- [j1]Mariusz Grech
Direct product of automorphism groups of colored graphs. Discret. Math. 283(1-3): 81-86 (2004)
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 2025-01-20 22:52 CET 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: