Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring

DOI10.1002/JGT.23066arXiv2301.04881OpenAlexW4389382778MaRDI QIDQ6201022

L. Picasarri-Arrieta

Publication date: 25 March 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.04881

zbMATH Keywords

oriented graphsdirected graphsreconfigurationdichromatic numbergraph recolouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Strengthened Brooks' theorem for digraphs of girth at least three
• Mixing 3-colourings in bipartite graphs
• The dichromatic number of a digraph
• Introduction to reconfiguration
• Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
• A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
• The complexity of change
• Finding paths between 3-colorings
• Gallai's Theorem for List Coloring of Digraphs
• The circular chromatic number of a digraph

This page was built for publication: Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring