Related papers: Random Graph Coloring - a Statistical Physics Appr…
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The…
The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-colored temporal graph, asks for a path whose vertices have…
In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper $r$-coloring $\varphi$ of a graph $G$. We investigate the problem of finding a proper $r$-coloring of $G$, which is "the…
In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach…
In these lectures I will present an introduction to the results that have been recently obtained in constraint optimization of random problems using statistical mechanics techniques. After presenting the general results, in order to…
For a positive integer $k$, a $k$-colouring of a graph $G=(V,E)$ is a mapping $c: V\rightarrow\{1,2,...,k\}$ such that $c(u)\neq c(v)$ whenever $uv\in E$. The Colouring problem is to decide, for a given $G$ and $k$, whether a $k$-colouring…
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal…
The problem of injective coloring in graphs can be revisited through two different approaches: coloring the two-step graphs and vertex partitioning of graphs into open packing sets, each of which is equivalent to the injective coloring…
We propose the notion of a majority $k$-edge-coloring of a graph $G$, which is an edge-coloring of $G$ with $k$ colors such that, for every vertex $u$ of $G$, at most half the edges of $G$ incident with $u$ have the same color. We show the…
Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For $\alpha \leq 1$ and $k \in \mathbb{Z}^+$, we say that a graph $G=(V,E)$ is…
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…
One method to obtain a proper vertex coloring of graphs using a reasonable number of colors is to start from any arbitrary proper coloring and then repeat some local re-coloring techniques to reduce the number of color classes. The Grundy…
A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…
A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…
Graph colorings is a fundamental topic in graph theory that require an assignment of labels (or colors) to vertices or edges subject to various constraints. We focus on the harmonious coloring of a graph, which is a proper vertex coloring…
Coloring the vertices of a graph G subject to given conditions can be considered as a random experiment and corresponding to this experiment, a discrete random variable X can be defined as the colour of a vertex chosen at random, with…
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our…
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored:…
We study a graph coloring problem that is otherwise easy but becomes quite non-trivial in the one-pass streaming model. In contrast to previous graph coloring problems in streaming that try to find an assignment of colors to vertices, our…
This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switching. We show that the problem is NP-hard and evaluate the…