13 citations · 25 across the 7 of their papers we have counts for
7 papers
Divisibility properties of Dedekind numbers
Bartlomiej Pawelski, Andrzej Szepietowski
We study some divisibility properties of Dedekind numbers. We show that the ninth Dedekind number is congruent to 6 modulo 210.
Fixes of permutations acting on monotone Boolean functions
Andrzej Szepietowski
We present a few algorithms and methods to count fixes of permutations acting on monotone Boolean functions. Some of these methods was used by Pawelski \cite{P} to compute the numb…
Negative closed walks in signed graphs: A note
Andrzej Szepietowski
Recently Naserasr, Sopena, and Zaslavsky [R. Naserasr, É. Sopena, T. Zaslavsky,Homomorphisms of signed graphs: An update, arXiv: 1909.05982v1 [math.CO] 12 Sep 2019.] published a re…
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
Janusz Dybizbański, Andrzej Szepietowski
We consider hypercubes with pairwise disjoint faulty edges. An -dimensional hypercube is an undirected graph with nodes, each labeled with a distinct binary strings…
Hamiltonian cycles in hypercubes with faulty edges
Janusz Dybizbański, Andrzej Szepietowski
Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with faulty edges, Information Sciences, 215 (2012) 75--82] observed that the hypercube is not Hamilton…
Coloring directed cycles
Andrzej Szepietowski
Sopena in his survey [E. Sopena, The oriented chromatic number of graphs: A short survey, preprint 2013] writes, without any proof, that an oriented cycle can be colored w…
Oriented chromatic number of Halin graphs
Janusz Dybizbański, Andrzej Szepietowski
Oriented chromatic number of an oriented graph is the minimum order of an oriented graph such that admits a homomorphism to . The oriented chromatic number of an uno…