Results 41 to 50 of about 331 (182)
Forbidden induced subgraphs for star-free graphs
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fujisawa, Jun +3 more
openaire +1 more source
Strategic Management Journal, EarlyView.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
Line game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move. $Y\in\{A,B,-\}$.
Stephan Dominique Andres, Wai Lam Fong
doaj +1 more source
On the forbidden induced subgraph sandwich problem
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dantas, Simone +3 more
openaire +2 more sources
Pairwise Imitation and Tournament Graphs
International Economic Review, EarlyView.ABSTRACT This paper investigates strategic dynamics under the behavioral rule of pairwise interact and imitate (PII), which requires minimal information and emphasizes outperforming opponents in pairwise interactions. We characterize PII using weak tournament graphs and, for a broad class of dynamics, establish a one‐shot stability result for ...
Sung‐Ha Hwang +3 more
wiley +1 more source
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs [PDF]
The class of word-representable graphs, introduced in connection with the study of the Perkins semigroup by Kitaev and Seif, has attracted significant attention in combinatorics and theoretical computer science due to its deep connections with graph orientations and combinatorics on words.
Eshwar Srinivasan +1 more
openalex +3 more sources
Compatible Spanning Circuits and Forbidden Induced Subgraphs
Graphs and CombinatoricsAbstractA compatible spanning circuit in an edge-colored graph G (not necessarily properly) is defined as a closed trail containing all vertices of G in which any two consecutively traversed edges have distinct colors. The existence of extremal compatible spanning circuits (i.e., compatible Hamilton cycles and compatible Euler tours) has been studied ...
Zhiwei Guo +3 more
openaire +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
Diophantine tuples and product sets in shifted powers
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley +1 more source
Forbidden induced subgraphs for line graphs
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources