A Sharp Threshold Phenomenon in String Graphs. [PDF]
Discrete Comput Geom, 2022 Tomon I.
europepmc +1 more source
Forbidden Induced Subgraphs of Power Graphs of Finite Groups
, 2023 For different algebraic structures like groups, semigroups, rings, vector spaces, etc, we can prescribe various graph structures. The power graph is one such major graph representation which was initially defined for semigroups using the power ...
Manna, Pallabi
core
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]
Discrete Comput Geom, 2023 Casel K +4 more
europepmc +1 more source
Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]
Nat Commun, 2023 Dong P +4 more
europepmc +1 more source
Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs [PDF]
, 2018 A (P3-free, K3-free)-colouring of a graph G = (V, E) is a partition of V = A ∪ B such that G[A] is P3-free and G[B] is K3-free. This problem is known to be NP-complete even when restricted to planar graphs and perfect graphs.
Abu-Khzam, Faisal N. +2 more
core
Getting new algorithmic results by extending distance-hereditary graphs via split composition. [PDF]
PeerJ Comput Sci, 2021 Cicerone S, Di Stefano G.
europepmc +1 more source
Characterization of graphs dominated by induced paths
, 2007 We give a characterization, in terms of forbidden induced subgraphs, of those graphs in which every connected induced subgraph has a dominating induced path on at most k vertices (k⩾3).
Tuza, Zs., Voigt, M., Bacsó, G.
core +1 more source
Photonic passbands induced by optical fractal effect in Cantor dielectric multilayers. [PDF]
PLoS One, 2022 Liu J, Shen J, Zhao D, Zhang P.
europepmc +1 more source
Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs
Let $G$ be a simple finite connected graph. The line graph $L(G)$ of graph $G$ is the graph whose vertices are the edges of $G$, where $ef \in E(L(G))$ when $e \cap f \neq \emptyset$. Iteratively, the higher order line graphs are defined inductively as $L^1(G) = L(G)$ and $L^n(G) = L(L^{n-1}(G))$ for $n \geq 2$.
Aryan Sanghi +2 more
openaire +2 more sources
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Algorithms Mol Biol, 2023 Marchand B +4 more
europepmc +1 more source