Results 191 to 200 of about 14,027 (232)
The Complexity of Surjective Homomorphism Problems—A Survey
We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction.
Manuel Bodirsky +2 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Functional Analysis and Its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turan, Bahri, Aslantaş, Mustafa
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turan, Bahri, Aslantaş, Mustafa
openaire +3 more sources
Computer Science Review, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Hell, Jaroslav Nesetril
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Hell, Jaroslav Nesetril
openaire +1 more source
Independence and graph homomorphisms graph homomorphisms
Journal of Graph Theory, 1993AbstractA 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 +2 more
openaire +1 more source
Combinatorics, Probability and Computing, 2005
The dimension of a graph, that is the dimension of its incidence poset, became a major bridge between posets and graphs. Although allowing a nice characterization of planarity, this dimension badly behaves with respect to homomorphisms. We introduce the universal dimension of a graph G as the maximum dimension of a graph having a homomorphism to G. The
Ossona de Mendez, Patrice +1 more
openaire +3 more sources
The dimension of a graph, that is the dimension of its incidence poset, became a major bridge between posets and graphs. Although allowing a nice characterization of planarity, this dimension badly behaves with respect to homomorphisms. We introduce the universal dimension of a graph G as the maximum dimension of a graph having a homomorphism to G. The
Ossona de Mendez, Patrice +1 more
openaire +3 more sources
Approximate Homomorphisms II: Group Homomorphisms
Combinatorica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
COMBINATORICA, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2004
Abstract This is a book about graph homomorphisms, intended to introduce this exciting topic to a wide audience. It attempts to bring together what the authors see as the highlights of the theory and its many applications, and could be read as a sampler of this rich theory, and its most interesting results, techniques, and ...
Pavol Hell, Jaroslav Nesetril
openaire +1 more source
Abstract This is a book about graph homomorphisms, intended to introduce this exciting topic to a wide audience. It attempts to bring together what the authors see as the highlights of the theory and its many applications, and could be read as a sampler of this rich theory, and its most interesting results, techniques, and ...
Pavol Hell, Jaroslav Nesetril
openaire +1 more source
On Lie Ideals With Derivations as Homomorphisms and Anti-Homomorphisms
Acta Mathematica Hungarica, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N Rehman
exaly +2 more sources
Fuzzy Sets and Systems, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Su-Yun Li +3 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Su-Yun Li +3 more
openaire +3 more sources

