Results 81 to 90 of about 9,740 (155)
Strategic Management Journal, Volume 47, Issue 7, Page 1840-1877, July 2026.Abstract Research Summary We extend ecosystem theory to cases in which platforms are complementors to each other: inter‐platform ecosystems. Analyzing web traffic data on 241 European platforms, we identify and characterize demand‐side inter‐platform ecosystems, and propose a theory of why they emerge.
Bruno Carballa‐Smichowski +3 more
wiley +1 more source
Forbidden Pairs and (k,m)-Pancyclicity
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each r ∈ {m, m+1, . . . , n}.
Crane Charles Brian
doaj +1 more source
Characterising and recognising game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Consider a vertex colouring game played on a simple graph with $k$ permissible colours. Two players, a maker and a breaker, take turns to colour an uncoloured vertex such that adjacent vertices receive different colours.
Dominique Andres, Edwin Lock
doaj +1 more source
Induced Minor Free Graphs: Isomorphism and Clique-width
, 2016 Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions.
Belmonte, Rémy +2 more
core +1 more source
The Independence Ratio of 4‐Cycle‐Free Planar Graphs
Journal of Graph Theory, Volume 112, Issue 2, Page 116-127, June 2026.ABSTRACT We prove that every n‐vertex planar graph G with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε for ε = 1 ∕ 30. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no adjacent triangles and no triangle sharing an edge with a 5‐cycle.
Tom Kelly +3 more
wiley +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, Volume 87, Issue 4, Page 404-427, June 2026.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz +2 more
wiley +1 more source
Subgraphs and Colourability of Locatable Graphs [PDF]
, 2014 We study a game of pursuit and evasion introduced by Seager in 2012, in which a cop searches the robber from outside the graph, using distance queries. A graph on which the cop wins is called locatable.
Johnson, Richard A. B., Koch, Sebastian
core
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
, 2015 Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets
AE Mouawad +12 more
core +1 more source
Recoloring via Modular Decomposition
Journal of Graph Theory, Volume 111, Issue 4, Page 113-123, April 2026.ABSTRACT The reconfiguration graph of the k‐colorings of a graph G, denoted R k ( G ), is the graph whose vertices are the k‐colorings of G and two colorings are adjacent in R k ( G ) if they differ in color on exactly one vertex. A graph G is said to be recolorable if R ℓ ( G ) is connected for all ℓ ≥ χ ( G ) + 1.
Manoj Belavadi +2 more
wiley +1 more source
Zero divisors and units with small supports in group algebras of torsion-free groups
, 2017 We associate a graph to a possible non-zero zero-divisor in the group algebra of a torsion-free group.Comment: to appear in Communications in Algebra.
Abdollahi, Alireza, Taheri, Zahra
core +1 more source