Result 1 to 20 of 36 total
Supergraphs and graphical complexity of permutation groups. (English)
Ars Comb. 101, 193-207 (2011).
1
Rainbow induced subgraphs in proper vertex colorings. (English)
Fundam. Inform. 111, No. 4, 437-451 (2011).
2
On the problem of freeness of multiplicative matrix semigroups. (English)
Theor. Comput. Sci. 411, No. 7-9, 1115-1120 (2010).
3
On the length of shortest 2-collapsing words. (English)
Discrete Math. Theor. Comput. Sci. 11, No. 1, 33-44, electronic only (2009).
4
Totally symmetric colored graphs. (English)
J. Graph Theory 62, No. 4, 329-345 (2009).
5
Collapsing words, permutation conditions and coherent colorings of trees. (English)
Theor. Comput. Sci. 410, No. 21-23, 2135-2147 (2009).
6
On the length of shortest 2-collapsing words (English)
Discrete Mathematics & Theoretical Computer Science 11, No. 1, 33-44 (2009).
7
Totally symmetric colored graphs (English)
Journal of Graph Theory 62, No. 4, 329-345 (2009).
8
2-synchronizing words. (English)
Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. Second international conference, LATA 2008, Tarragona, Spain, March 13‒19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-88281-7/pbk). Lecture Notes in Computer Science 5196, 221-231 (2008).
9
Graphical complexity of products of permutation groups. (English)
Discrete Math. 308, No. 7, 1142-1152 (2008).
10
Polyboxes, cube tilings and rigidity (English)
Discrete & Computational Geometry 40, No. 1, 1-30 (2008).
11
2-synchronizing words (English)
LATA, 221-231 (2008).
12
A combinatorial approach to collapsing words. (English)
Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2006. 31st international symposium, MFCS 2006, Stará Lesná, Slovakia, August 28‒September 1, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37791-3/pbk). Lecture Notes in Computer Science 4162, 256-266 (2006).
13
Rings and semigroups with permutable zero products. (English)
J. Pure Appl. Algebra 206, No. 3, 355-369 (2006).
14
A combinatorial approach to collapsing words (English)
MFCS, 256-266 (2006).
15
Recognizing collapsing words is co-NP-complete (English)
DCFS, 106-117 (2006).
16
Pseudo-random properties of self-complementary symmetric graphs. (English)
J. Graph Theory 47, No. 4, 310-316 (2004).
17
Complexity of semigroup identity checking. (English)
Int. J. Algebra Comput. 14, No. 4, 455-464 (2004).
18
Direct product of automorphism groups of colored graphs. (English)
Discrete Math. 283, No. 1-3, 81-86 (2004).
19
Pseudo-random properties of self-complementary symmetric graphs (English)
Journal of Graph Theory 47, No. 4, 310-316 (2004).
20
Result 1 to 20 of 36 total
Start
Contact
Print
General Help
