Iskanje po repozitoriju

A+ | A- | | SLO | ENG

Povzetek: This chapter explores the dynamic interplay between industrial symbiosis and social media as catalysts for sustainable development. Industrial symbiosis as a circular economy approach and digital innovation are now tangible and unstoppable realities that profoundly affect every sector of our society, while social media and the web serve as crucial and indispensable platforms for dissemination. This is like a stage and a privileged forum from which to observe, understand and attempt to change the complexity of reality. This combination is particularly relevant for the new generations. Social networks are integral to companies’ and brands’ new communication and sustainable development models. This chapter discusses industrial symbiosis, a collaborative concept where industries share resources and waste. Simultaneously, it explores how the changing role of social media aligns with these principles, promoting a more responsible and aware approach to development and communication.
Ključne besede: industrial symbiosis, social media, sustainable development, social networks
Objavljeno v DiRROS: 03.04.2026; Ogledov: 106; Prenosov: 59
Celotno besedilo (7,72 MB)
Gradivo ima več datotek! Več...

Povzetek: Integrating bioeconomy principles into the emerging Industry 5.0 agenda is presented as a way to reconcile competitiveness with sustainability, resilience, and human-centric development. This chapter examines how stakeholder governance in rural regions enables or constrains such transformations, with a particular focus on the roles of governance enablers and barriers in the relevance of territorial/local self-government. Conceptually, it links debates on stakeholder governance, the bioeconomy, and Industry 5.0, arguing that rural bioeconomy pathways are shaped by the interplay of institutions, networks, and cognitive frames, rather than technology or markets alone. This article examines how stakeholder governance arrangements enable or constrain rural bioeconomy transformation across three case regions (Slovenia, Montenegro, and Baden-Württemberg). Using Industry 5.0 as a normative frame and SOFIA as an analytical coding approach, it identifies key institutional, network, and cognitive enablers and barriers, and derives governance-relevant implications for territorial development.
Ključne besede: biogospodarstvo, Industry 5.0, stakeholder governance, rural development, circular economy, multi-level governance
Objavljeno v DiRROS: 27.03.2026; Ogledov: 155; Prenosov: 59
Celotno besedilo (3,60 MB)

Povzetek: The article investigates the mechanisms through which social forces, networks, cognitive frames, and institutions shape public opinion in Southeast Europe via communication. Employing a qualitative approach, data was collected through synchronous focus groups conducted in six Southeast European countries. The findings reveal that social networks play a pivotal role in shaping public opinion, with organizational position and relationships influencing communication effectiveness. Cognitive frames significantly impact public perception, with entrenched beliefs guiding interpretation of information. Meanwhile, social institutions, such as language and communication rules, influence the clarity and accessibility of messages, thereby shaping public understanding. The research underscores the need for deeper research, ethical standards, and transparent communication to build and maintain public trust. Continuous engagement with the public and adaptability in communication strategies are essential for fostering mutual understanding and trust. This research emphasizes social forces’ complexity and overlapping nature in shaping public opinion and the strategic approaches required for effective communication in Southeast Europe.
Ključne besede: public communication, networks, cognitive frames, institutions, Southeast Europe, public opinion
Objavljeno v DiRROS: 18.02.2026; Ogledov: 307; Prenosov: 100
Celotno besedilo (440,44 KB)

Povzetek: A ▫${\ strong edge-coloring}$▫ of a graph is a proper edge-coloring, in which the edges of every path of length ▫$3$▫ receive distinct colors; in other words, every pair of edges at distance at most ▫$2$▫ must be colored differently. The least number of colors needed for a strong edge-coloring of a graph is the ▫${\ strong chromatic index}$▫. We consider the list version of the coloring and prove that the list strong chromatic index of graphs with maximum degree ▫$3$▫ is at most ▫$10$▫. This bound is tight and improves the previous bound of ▫$11$▫ colors. We also consider the question whether the strong chromatic index and the list strong chromatic index always coincide. We answer it in negative by presenting an infinite family of graphs for which the two invariants differ. For the special case of the Petersen graph, we show that its list strong chromatic index equals ▫$7$▫, while its strong chromatic index is ▫$5$▫. Up to our best knowledge, this is the first known edge-coloring for which there are graphs with distinct values of the chromatic index and its list version. In relation to the above, we also initiate the study of the list version of the normal edge-coloring. A ▫${\ normal edge-coloring}$▫ of a cubic graph is a proper edge-coloring, in which every edge is adjacent to edges colored with ▫$4$▫ distinct colors or to edges colored with ▫$2$▫ distinct colors. It is conjectured that ▫$5$▫ colors suffice for a normal edge-coloring of any bridgeless cubic graph and this statement is equivalent to the Petersen Coloring Conjecture. It turns out that similarly to strong edge-coloring, list normal edge-coloring is much more restrictive and consequently for many graphs the list normal chromatic index is greater than the normal chromatic index. In particular, we show that there are cubic graphs with list normal chromatic index at least ▫$9$▫, there are bridgeless cubic graphs with its value at least ▫$8$▫, and there are cyclically ▫$4$▫-edge-connected cubic graphs with value at least ▫$7$▫.
Ključne besede: strong edge-coloring, list strong edge-coloring, normal edge-coloring, list normal edge-coloring, Petersen coloring, Petersen coloring conjecture
Objavljeno v DiRROS: 05.02.2026; Ogledov: 618; Prenosov: 123
Celotno besedilo (882,58 KB)

Povzetek: A proper coloring ▫$\phi$▫ of ▫$G$▫ is called a proper conflict-free coloring of ▫$G$▫ if for every non-isolated vertex ▫$v$▫ of ▫$G$▫, there is a color ▫$c$▫ such that ▫$|\phi^{-1}(c) \cap N_G(v)| = 1$▫. As an analogy of degree-choosability of graphs, we introduced the notion of proper conflict-free (degree ▫$+k$▫)-choosability of graphs. For a non-negative integer ▫$k$▫, a graph ▫$G$▫ is proper conflict-free (degree ▫$+k$▫)-choosable if for any list assignment ▫$L$▫ of ▫$G$▫ with ▫$|L(v)| \ge d_G(v) + k$▫ for every vertex ▫$v \in V(G)$▫, ▫$G$▫ admits a proper conflict-free coloring ▫$\phi$▫ such that ▫$\phi(v) \in L(v)$▫ for every vertex ▫$v \in V(G)$▫. In this note, we first remark if a graph ▫$G$▫ is ▫$d$▫-degenerate, then ▫$G$▫ is proper conflict-free (degree ▫$+d+1$▫)-choosable. Furthermore, when ▫$d=1$▫, we can reduce the number of colors by showing that every tree is proper conflict-free (degree ▫$+1$▫)-choosable. This motivates us to state a question.
Ključne besede: proper conflict-free coloring, list coloring, degree-choosability, degeneracy
Objavljeno v DiRROS: 05.02.2026; Ogledov: 416; Prenosov: 184
Celotno besedilo (495,29 KB)
Gradivo ima več datotek! Več...