Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Andrzej Kisielewicz"'
Autor:
Mariusz Grech, Andrzej Kisielewicz
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 3, Iss Automata, Logic and Semantics (2013)
Automata, Logic and Semantics
Externí odkaz:
https://doaj.org/article/22129ea8bd544b06bab79f4086835615
Autor:
Mariusz Grech, Andrzej Kisielewicz
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 1, Iss Graph Theory (2013)
Graph Theory
Externí odkaz:
https://doaj.org/article/11e9d17e0dde43868641d3c22e176aed
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 11 no. 1, Iss Automata, Logic and Semantics (2009)
Automata, Logic and Semantics
Externí odkaz:
https://doaj.org/article/6a4e479e992d47678f872e8cecd20c6f
Autor:
Mariusz Grech, Andrzej Kisielewicz
Publikováno v:
Journal of Algebraic Combinatorics. 57:1045-1072
A permutation group G on a set $$\Omega $$ Ω is called orbit closed if every permutation of $$\Omega $$ Ω preserving the orbits of G in its action on the power set $$P(\Omega )$$ P ( Ω ) belongs to G. It is called a relation group if there exists
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86b3216958eacfd6e93dff230001f73c
https://doi.org/10.1007/s10801-022-01214-2
https://doi.org/10.1007/s10801-022-01214-2
Autor:
Andrzej Kisielewicz, Mariusz Grech
Publikováno v:
Discrete Applied Mathematics. 285:128-140
In this paper we consider the Cerný conjecture from the point of view of colored digraphs corresponding to automata. We prove this conjecture for a new class of automata that is defined in terms of graph-theoretic properties related to crossing path
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa27797e9874bee1097bd1d7c59d25bb
https://doi.org/10.1016/j.dam.2020.04.029
https://doi.org/10.1016/j.dam.2020.04.029
Autor:
Andrzej Kisielewicz, Mariusz Grech
Publikováno v:
Discrete Applied Mathematics. 277:172-179
In this paper we prove that a permutation group A generated by a single permutation σ is an automorphism group of an edge-colored graph if and only if for every orbit O of σ with cardinality | O | ≥ 3 there exists another orbit O ′ of σ such t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5b6e6beae35ff25ca25e445e462f104
https://doi.org/10.1016/j.dam.2019.09.018
https://doi.org/10.1016/j.dam.2019.09.018
Autor:
Mariusz Grech, Andrzej Kisielewicz
Publikováno v:
European Journal of Combinatorics. 106:103526
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68d57f840a838eaeba61abc381f4fa2c
https://doi.org/10.1016/j.ejc.2022.103526
https://doi.org/10.1016/j.ejc.2022.103526
Autor:
Andrzej Kisielewicz, Mariusz Grech
Publikováno v:
Graphs and Combinatorics. 35:1405-1432
In this paper we establish conditions for a permutation group generated by a single permutation to be an automorphism group of a graph. This solves the so called concrete version of König’s problem for the case of cyclic groups. We establish also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b40b9e77c970aa7673435088ddbc6df3
https://doi.org/10.1007/s00373-019-02096-1
https://doi.org/10.1007/s00373-019-02096-1
Autor:
Mariusz Grech, Andrzej Kisielewicz
Publikováno v:
European Journal of Combinatorics. 99:103414
The distinguishing index D ′ ( Γ ) of a graph Γ is the least number k such that Γ has an edge-coloring with k colors preserved only by the trivial automorphism. In this paper we prove that if the automorphism group of a finite graph Γ is simple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e40df824e773d6c388a5f52ed20dc558
https://doi.org/10.1016/j.ejc.2021.103414
https://doi.org/10.1016/j.ejc.2021.103414
Autor:
Andrzej Kisielewicz
Publikováno v:
Studia Philosophica Wratislaviensia. 13:137-170
In reply to the polemics and comments on my bookLogic and ArgumentationThis article contains the reply to the polemics and comments on my book Logic and argumentation. Since the most controversial issue among the commentators was my “radical attack
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcc48a10049298885df156bf27446059
https://doi.org/10.19195/1895-8001.13.3.12
https://doi.org/10.19195/1895-8001.13.3.12