Results 41 to 50 of about 14,027 (232)
Explicit 3‐colorings for Exponential Graphs
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento +2 more
wiley +1 more source
Torelli groups are subgroups of mapping class groups that consist of those diffeomorphism classes that act trivially on the homology of the associated closed surface. The Johnson homomorphism, defined by Dennis Johnson, and its generalization, defined by S. Morita, are tools for understanding Torelli groups.
openaire +3 more sources
Line Graphs of Multigraphs and the Forbidden Graph E 6
ABSTRACT The line graph Γ of a multigraph Δ is the graph whose vertices are the edges of Δ, where two such edges are adjacent if and only if they meet in a single vertex of Δ. We provide several characterizations of such line graphs and in particular show that a graph is a line graph if and only if it does not contain one of the 32 graphs, all of which
Hans Cuypers
wiley +1 more source
On homomorphism-homogeneous point-line geometries [PDF]
A relational structure is homomorphism-homogeneous if every homomorphism between finite substructures extends to an endomorphism of the structure. A point-line geometry is a non-empty set of elements called points, together with a collection of subsets ...
Jungabel, Ėva
core +1 more source
On generalized derivations as homomorphisms and anti-homomorphisms
The concept of derivations as well as generalized derivations (i.e. Ia,b(x) = ax + xb, for all a,b R) have been generalized as an additive function F : R R satisfying F(xy) = F(x)y + xd(y) for all x,y R, where d is a nonzero derivation on R. Such a function F is said to be a generalized derivation.
openaire +4 more sources
On Sparsity Conditions Guaranteeing a Fractional Coloring
ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley +1 more source
AbstractThe study of homomorphic encryption techniques has led to significant advancements in the computing domain, particularly in the sphere of cloud computing. Homomorphic encryption provides a means for securely transmitting and storing confidential information across and in a computer system.
Monique Ogburn +2 more
openaire +2 more sources
Saturated Partial Embeddings of Planar Graphs
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
Homomorphisms of the lattice of slowly oscillating functions on the half-line
We study the space H(SO) of all homomorphisms of the vector lattice of all slowly oscillating functions on the half-line ℍ = [ 0 , ∞ ) . In contrast to the case of homomorphisms of uniformly continuous functions, it is shown that a homomorphism in H(SO ...
Yutaka Iwamoto
doaj +1 more source
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source

