Results 21 to 30 of about 1,058,735 (299)
On powers of circular arc graphs
A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $G^k\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if $G^k\in\mathcal{C}$, then $G^{k+1}\in\mathcal{C}$.
Ashok Kumar Das, Indrajit Paul
openaire +2 more sources
Contact Graphs of Circular Arcs [PDF]
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most \(2s-k\) edges, and (2, k)-tight if in ...
Md. Jawaherul Alam +6 more
openaire +4 more sources
Circular arc bigraphs and their Helly subclass [PDF]
Orientadora: Marina GroshausCoorientador: André Luiz Pires GuedesTese (doutorado) - Universidade Federal do Paraná, Setor de Tecnologia, Programa de Pós-Graduação em Informática. Defesa : Curitiba, 09/06/2021Inclui referências: p.
Kolberg, Fabricio Schiavon, 1990-
core
Pathwidth of Circular-Arc Graphs [PDF]
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time.
Karol Suchan, Ioan Todinca
openaire +2 more sources
Stress-distribution at the rigid circular-arc inclusion end
The elastic plane problem of a rigid co-circular arc inclusion under arbitrary loads is dealt with. Applying Schwarz's reflection principle integrated with the analysis of the singularity of complex stress functions, the general solution of the problem ...
LIU, YW (reprint author), CENT S UNIV TECHNOL,DEPT APPL MATH & MECH,CHANGSHA 410083,PEOPLES R CHINA. +2 more
core +1 more source
The Kakeya Problem for Circular Arcs [PDF]
We prove that if a circular arc has angle short enough, then it can be continuously moved to any prescribed position within a set of arbitrarily small area.
Héra, Kornélia, Laczkovich, Miklós
openaire +3 more sources
Map Schematization with Circular Arcs
We present an algorithm to compute schematic maps with circular arcs. Our algorithm iteratively replaces two consecutive arcs with a single arc to reduce the complexity of the output map and thus to increase its level of abstraction. Our main contribution is a method for replacing arcs that meet at high-degree vertices. This allows us to greatly reduce
Thomas C. van Dijk +4 more
openaire +3 more sources
LVRF (lymphatic and vascular resistance factor) is a VEGFA splice variant upregulated in response to anti‐angiogenic therapy that fosters tumor adaptation through enhanced vascularization, lymphangiogenesis, and metastatic dissemination. Targeting LVRF with fully human neutralizing antibodies disrupts these processes and limits resistant tumor growth ...
Marion David +12 more
wiley +1 more source
Subclasses of Normal Helly Circular-Arc Graphs [PDF]
A Helly circular-arc modelM = (C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, thenM is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly circular-arc model ...
Szwarcfiter, Jayme L. +5 more
core +1 more source
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source

