Related papers: Successful Pressing Sequences for a Bicolored Grap…
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…
We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…
In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as…
Szlam's Lemma began life as a way of getting upper bounds on the chromatic numbers of distance graphs in normed vector spaces. Now analogs are available in a variety of hypergraph settings, but the method always involves a shrewdly chosen…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a natural way. Let $H$ be a (properly) edge-colored graph. The…
In the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list.…
Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
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…
Recent investigations in computational biology focus on a family of 2-colored digraphs, called 2-colored best match graphs, which naturally arise from rooted phylogenetic trees. Actually the defining properties of such graphs are…
Inspired by earlier results about proper and polychromatic coloring of hypergraphs, we investigate such colorings of directed hypergraphs, that is, hypergraphs in which the vertices of each hyperedge is partitioned into two parts, a tail…
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…
This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…
In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which…
The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement. This computationally challenging problem is often relaxed as a…
Given a finite set of $2$-edge-coloured graphs $\mathcal F$ and a hereditary property of graphs $\mathcal{P}$, we say that $\mathcal F$ expresses $\mathcal{P}$ if a graph $G$ has the property $\mathcal{P}$ if and only if it admits a…
Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…