Abstract: We define several new types of quantum chromatic numbers of a graph and characterize them in terms of operator system tensor products. We establish inequalities between these chromatic ...

Graph homomorphisms and chromatic numbers are foundational concepts in modern graph theory, with widespread applications that extend from combinatorial optimisation to theoretical computer science. A ...

We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual ...

An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees.The purpose of this paper is to derive exact values of ...

ABSTRACT: A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorings of G is its d-distance ...

Abstract: Karger Motwani and Sudan (1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector k-colorable, and that for constant ...

This paper is devoted to a natural generalization of the problem on the chromatic number of the plane. The chromatic number of the spaces Rn×[0,ε]k is considered. It is proved that 5≤χ⁢(R2×[0,ε])≤7 ...

Genetik Algoritma yaklaşımının ortaya çıkışı 1970’lerin başında olmuştur. 1975’te John Holland’ın makine öğrenmesi üzerine yaptığı çalışmalarda canlılardaki evrimden ve değişimden etkilenerek, bu ...