#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1987

2017

- This year (0)
- Last 5 years (23)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dávid Hudák, Borut Luzar, Roman Soták, Riste Skrekovski
- Discrete Mathematics
- 2014

- Janka Rudasová, Roman Soták
- Discrete Mathematics
- 2008

The vertex-distinguishing index χs(G) of a graph G is the minimum number of colours required to properly colour the edges of G in such a way that any two vertices are incident with different sets of… (More)

- Wilbur H. Chen, K. M. A. Gartland, +5 authors Edward C. Cocking
- Plant Cell Reports
- 1987

Sugarcane protoplasts were transformed to kanamycin resistance at a frequency of approximately 8 in 107 following PEG-induced uptake of Sma1 linearised pABD1 plasmid. DNA-treated protoplasts were… (More)

- Mirko Hornák, Stanislav Jendrol, Ingo Schiermeyer, Roman Soták
- Journal of Graph Theory
- 2015

In the article, the existence of rainbow cycles in edge colored plane triangulations is studied. It is shown that the minimum number rb(Tn,C3) of colors that force the existence of a rainbow C3 in… (More)

- Róbert Hajduk, Roman Soták
- Discrete Mathematics
- 2010

A graph H is said to be light in a family H of graphs if each graph G ∈ H containing a subgraph isomorphic to H contains also an isomorphic copy of H such that each its vertex has the degree (in G)… (More)

- Frédéric Havet, Stanislav Jendrol, Roman Soták, Erika Skrabulakova
- 2009

A sequence r1, r2, . . . , r2n such that ri = rn+i for all 1 ≤ i ≤ n, is called a repetition. A sequence S is called non-repetitive if no block (i.e. subsequence of consecutive terms of S) is a… (More)

- Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók, Janka Oravcová, Roman Soták
- Discussiones Mathematicae Graph Theory
- 2015

Let P and Q be additive and hereditary graph properties, r, s ∈ N, r ≥ s, and [Zr] s be the set of all s-element subsets of Zr. An (r, s)-fractional This work was supported by the Slovak Science and… (More)

- Stanislav Jendrol, Jozef Miskuf, Roman Soták
- Discrete Mathematics
- 2007

A total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges of G with labels from the set {1, . . . , k} in such a way that for any two different edges e and f their… (More)

- Scott A. Merkle, A. T. Wiecko, Roman Soták, Harry E. Sommer
- In Vitro Cellular & Developmental Biology
- 2007

Embryogenic suspension cultures of the hardwood forest tree yellow-poplar (Liriodendron tulipifera) have the potential to produce millions of plantlets. However, low conversion frequencies limit the… (More)

- Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski, Peter Sugerek
- Discrete Applied Mathematics
- 2015

An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance atmost l on a boundarywalk of any face receive distinct colors. It is conjectured that 3 l+ 1… (More)