72 research outputs found

    Model of Enterpreneurship and Social-cultural and Market Orientation of Small Business Owners in Poland

    Get PDF
    In the development of SMEs in Poland crucial meaning is legislation, steadily adapted to EU regulations, especially to the European Charter for Small Enterprises. Research conducted in Poland by many authors provide data for doing so, to confirm the hypothesis that among small businesses a vital role in shaping their work situation did not continue to play the market mechanisms and orientations, but mainly socio-cultural factors.W rozwoju MŚP w Polsce podstawowe znaczenie mają również uregulowania prawne, systematycznie dostosowywane do regulacji unijnych, zwłaszcza zaś do Europejskiej Karty Małych Przedsiębiorstw. Badania prowadzone w Polsce przez wielu autorów dostarczają danych ku temu, by potwierdzić tezę, że wśród drobnych przedsiębiorców decydującą rolę w kształtowaniu ich sytuacji pracy odgrywają nadal nie mechanizmy i orientacje rynkowe, ale przede wszystkim czynniki społeczno-kulturowe

    Remarques sur la construction des graphes symetriques

    No full text
    The article contains no abstrac

    Maximal sets of Hamilton cycles in Kn,n

    No full text
    In this article, we prove that there exists a maximal set of m Hamilton cycles in K-n,K-n if and only if n/4 < m less than or equal to n/2. (C) 2000 John Wiley & Sons, Inc

    3-consecutive edge coloring of a graph

    No full text
    AbstractThree edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of length 3. The 3-consecutive edge coloring number ψ3c′(G) of G is the maximum number of colors permitted in a coloring of the edges of G such that if e1, e2 and e3 are consecutive edges in G, then e1 or e3 receives the color of e2. Here we initiate the study of ψ3c′(G).A close relation between 3-consecutive edge colorings and a certain kind of vertex cut is pointed out, and general bounds on ψ3c′ are given in terms of other graph invariants. Algorithmically, the distinction between ψ3c′=1 and ψ3c′=2 is proved to be intractable, while efficient algorithms are designed for some particular graph classes
    corecore