Tag: graphs
Proper conflict-free colourings of graphs
summary: Given a graph \(G\) of maximum degree \(\Delta\), the proper colouring problem asks for the minimum number of colours that can be assigned to the vertices of \(G\) such that no pair of adjacent vertices are given the same colour; it is easy to show that at most \(\Delta ...
On the complexity of computing tree-partitions
summary: Tree-partitions are graph decompositions that correspond to mapping vertices to nodes of a tree in such a way that adjacent vertices in the graph are either mapped to adjacent nodes of the tree or to the same node. The width of a tree-partition is the maximum number of vertices ...
On the Structure of Potential Counterexamples to the Borodin-Kostochka Conjecture
summary: The Borodin-Kostochka conjecture, a long-standing problem in graph theory, asserts that every graph \(G\) with maximum degree \(\Delta \geq 9\) satisfies \(\chi(G) \leq max \{\Delta - 1, \omega(G)\}\) where \(\chi(G)\) and \(\omega(G)\) are respectively the chromatic number and the clique number of \(G\). While the conjecture ...
Excluding a rectangular grid
summary: For every positive integer k, we define the k-treedepth as the largest graph parameter td_k satisfying (i) td_k(∅)=0; (ii) td_k(G) <= 1+ td_k(G-u) for every graph G and every vertex u; and (iii) if G is a (
Eliminating more than vertices in graphs
summary: Considérons le jeu suivant sur un graphe. À chaque tour, le joueur peut enlever un sommet de chaque composante connexe du graphe courant. Le but du jeu est d’éliminer tous les sommets du graphe. Le nombre minimum de tours nécessaires est appelé la treedepth du graphe. C’est ...
Reconstruction de graphes via des requêtes sur les triplets
summary: Considérons un oracle disposant d'un graphe labellisé caché. L'objectif de la reconstruction de graphes est de retrouver ce graphe caché en interrogeant l'oracle avec certains types de requêtes. Les requêtes que nous examinons portent sur des triplets de sommets du graphe, plus précisément, sur la structure ...
Fractional domatic number and minimum degree
summary: We present a study of a graph parameter in graph theory, named the fractional domatic number. A dominating set in a graph is a set of vertices such that every vertex outside the set is adjacent to a vertex in the set. The domatic number of a graph is ...
Recent Advances in Distributed Coloring
summary: The study of distributed graph algorithms aims to understand the limitations inherent to local computations. In a seminal paper, Linial (1992, SIAM J. Computing) introduced the LOCAL model to formalize this question. In this model, the input graph is seen as a communication network where vertices are computers. They ...
An acylic orientation problem with parity constraints
summary: Let G = (V, E) be a connected graph and T be a subset of the vertices. An orientation of G is a choice of a direction for each edge of the graph, it is said to be acylic if does not contain any directed cycle. An orientation of G ...
Transversals in a collection of graphs with degree conditions
summary: Let G={G_1, G_2, ... , G_m} be a collection of n-vertex graphs on the same vertex set V (a graph system), and F be a simple graph with e(F) ≤ m. If there is an injection f: E(F) → [m] such that e &isinv E(G_{f(e)}) for each ...
Page 1 / 4 »