On the minimum number of arcs in 4-dicritical oriented graphs
type: Item
instance of: scholarly article
title: On the minimum number of arcs in 4-dicritical oriented graphs
author: Frédéric Havet
author: L. Picasarri-Arrieta
author: Clément Rambaud
published in: Journal of Graph Theory
publication date: 2025-01-06T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7962403
zbMATH Keywords: dichromatic number
zbMATH Keywords: dicritical digraphs
zbMATH Keywords: extremal graph theory
zbMATH Keywords: oriented graphs
zbMATH Keywords: potential method
MaRDI profile type: Publication
cites work: On the minimum number of arcs in \(k\)-dicritical oriented graphs
cites work: Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph
cites work: A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
cites work: On the structure of 5- and 6-chromatic abstract graphs.
cites work: Structure in sparse \(k\)-critical graphs
cites work: Gallai's Theorem for List Coloring of Digraphs
cites work: On the minimum number of arcs in $4$-dicritical oriented graphs
cites work: On the number of edges in colour-critical graphs and hypergraphs
cites work: The minimum number of edges in 4-critical digraphs of given order
cites work: Ore's conjecture on color-critical graphs is almost true
cites work: A Brooks-type result for sparse critical graphs
cites work: On the minimum number of edges in triangle-free 5-critical graphs
DOI: 10.1002/JGT.23159
description: scientific article; zbMATH DE number 7962403