Results 141 to 150 of about 514 (184)

Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]

Res Math Sci
Fink A, Giansiracusa J, Giansiracusa N, Mundinger J.   +3 more
europepmc   +1 more source

A novel approach to graph distinction through GENEOs and permutants. [PDF]

Sci Rep
Bocchi G, Ferri M, Frosini P.
europepmc   +1 more source

A cluster of results on amplituhedron tiles. [PDF]

Lett Math Phys
Even-Zohar C, Lakrec T, Parisi M, Sherman-Bennett M, Tessler R, Williams L.   +5 more
europepmc   +1 more source

Extending homomorphic algorithms for encrypted text comparison. [PDF]

Sci Rep
Seco-Aguirre I, Regueiro C, Bernabé-Rodríguez J, Jacob E.   +3 more
europepmc   +1 more source

Quantum game strategy solution for R&D cartel: Reorganizing government R&D investment strategy in Korea. [PDF]

PLoS One
Won D, Lim J, Lee B.
europepmc   +1 more source

Rigidity of Symmetric Frameworks on the Cylinder. [PDF]

Discrete Comput Geom
Nixon A, Schulze B, Wall J.
europepmc   +1 more source

Expected Complexity of Barcode Reduction. [PDF]

J Appl Comput Topol
Giunti B, Houry G, Kerber M, Söls M.
europepmc   +1 more source

Quadratic Subproduct Systems, Free Products, and Their C*-Algebras. [PDF]

Integr Equ Oper Theory
Arici F, Ge Y.
europepmc   +1 more source

Exact algorithm for graph homomorphism and locally injective graph homomorphism [PDF]

Information Processing Letters, 2014
For graphs $G$ and $H$, a homomorphism from $G$ to $H$ is a function $φ\colon V(G) \to V(H)$, which maps vertices adjacent in $G$ to adjacent vertices of $H$. A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in $H$.
Paweł Rzążewski
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Independence and graph homomorphisms graph homomorphisms

Journal of Graph Theory, 1993
AbstractA graph with n vertices that contains no triangle and no 5‐cycle and minimum degree exceeding n/4 contains an independent set with at least (3n)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism Lemma.
Michael O. Albertson, Lily Chan, Ruth Haas   +2 more
openaire   +1 more source