Results 41 to 50 of about 514 (184)
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
Journal of Graph Algorithms and Applications, 2016 In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph H and want to find all graphs, from some graph class, homomorphic
Christian Engels
doaj +1 more source
The equivariant topology of stable Kneser graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Schrijver introduced the stable Kneser graph $SG_{n,k}, n \geq 1, k \geq 0$. This graph is a vertex critical graph with chromatic number $k+2$, its vertices are certain subsets of a set of cardinality $m=2n+k$.
Carsten Schultz
doaj +1 more source
Forum of Mathematics, PiAbstract We introduce new types of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks [Mar16]. The motivation for the construction comes from the adaptation of this method to the $\mathsf {LOCAL}$
Sebastian Brandt +5 more
openaire +6 more sources
Forum of Mathematics, Sigma, 2018 We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like $k\log k$ for the graph of separating curves on a surface of Euler characteristic $-k$.
JONAH GASTER +2 more
doaj +1 more source
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source
Homomorphisms and polynomial invariants of graphs
European Journal of Combinatorics, 2007 Junta de Andalucía P06-FQM ...
Delia Garijo +2 more
openaire +5 more sources
Obstructions to some injective oriented colourings
Theory and Applications of GraphsEach of several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ leads to an injective oriented colouring problem.
Russell J Campbell +2 more
doaj +1 more source
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability [PDF]
TheoretiCSWe show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation.
David E. Roberson, Tim Seppelt
doaj +1 more source
An approximability-related parameter on graphs―-properties and applications [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Robert Engström +3 more
doaj +1 more source
A Study of Complex Dombi Fuzzy Graph With Application in Decision Making Problems
IEEE Access, 2022 A complex fuzzy set (CFS) is a generalization of a fuzzy set (FS) in which a limit of degrees occurs on the complex plane with unit disc. The averaging operators are a key part of turning all the data into one value.
Ehsan Mehboob Ahmed Butt +4 more
doaj +1 more source