Results 41 to 50 of about 312 (179)
On the 12-Representability of Induced Subgraphs of a Grid Graph
Discussiones Mathematicae Graph Theory, 2022 The notion of a 12-representable graph was introduced by Jones, Kitaev, Pyatkin and Remmel in [Representing graphs via pattern avoiding words, Electron. J. Combin. 22 (2015) #P2.53].
Chen Joanna N., Kitaev Sergey
doaj +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, EarlyView.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ 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$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +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
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
Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5−e)-free subgraphs [PDF]
Discrete Mathematics Letters, 2021 Rachel Johnson +4 more
doaj +1 more source
Characterizing the forbidden pairs for graphs to be super-edge-connected
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj +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
Line Graphs and Forbidden Induced Subgraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lai, Hong-Jian, Šoltés, Ľubomír
openaire +1 more source
Graphs whose Laplacian eigenvalues are almost all 1 or 2
Special MatricesWe explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2.
Mohammadian Ali, Xu Shanshan
doaj +1 more source