Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring

01/12/2023
by   Lucas Picasarri-Arrieta, et al.
0

Let D=(V,A) be a digraph. We define Δ_max(D) as the maximum of {max(d^+(v),d^-(v)) | v ∈ V } and Δ_min(D) as the maximum of {min(d^+(v),d^-(v)) | v ∈ V }. It is known that the dichromatic number of D is at most Δ_min(D) + 1. In this work, we prove that every digraph D which has dichromatic number exactly Δ_min(D) + 1 must contain the directed join of K_r and K_s for some r,s such that r+s = Δ_min(D) + 1. In particular, every oriented graph G⃗ with Δ_min(G⃗) ≥ 2 has dichromatic number at most Δ_min(G⃗). Let G⃗ be an oriented graph of order n such that Δ_min(G⃗) ≤ 1. Given two 2-dicolourings of G⃗, we show that we can transform one into the other in at most n steps, by recolouring one vertex at each step while maintaining a dicolouring at any step. Furthermore, we prove that, for every oriented graph G⃗ on n vertices, the distance between two k-dicolourings is at most 2Δ_min(G⃗)n when k≥Δ_min(G⃗) + 1. We then extend a theorem of Feghali to digraphs. We prove that, for every digraph D with Δ_max(D) = Δ≥ 3 and every k≥Δ +1, the k-dicolouring graph of D consists of isolated vertices and at most one further component that has diameter at most c_Δn^2, where c_Δ = O(Δ^2) is a constant depending only on Δ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2015

A Reconfigurations Analogue of Brooks' Theorem and its Consequences

Let G be a simple undirected graph on n vertices with maximum degree Δ. ...
research
01/09/2023

Digraph redicolouring

Given two k-dicolourings of a digraph D, we prove that it is PSPACE-comp...
research
06/19/2023

On the minimum number of arcs in 4-dicritical oriented graphs

The dichromatic number χ⃗(D) of a digraph D is the minimum number of col...
research
12/05/2022

(P6, triangle)-free digraphs have bounded dichromatic number

The dichromatic number of an oriented graph is the minimum size of a par...
research
01/29/2021

r-indexing Wheeler graphs

Let G be a Wheeler graph and r be the number of runs in a Burrows-Wheele...
research
11/23/2019

Oriented Diameter of Star Graphs

An orientation of an undirected graph G is an assignment of exactly one...
research
04/29/2019

The graphs behind Reuleaux polyhedra

This work is about graphs arising from Reuleaux polyhedra. Such graphs m...

Please sign up or login with your details

Forgot password? Click here to reset