The \(m\)-degenerate chromatic number of a digraph

DOI10.1016/j.disc.2016.01.024zbMath1333.05110arXiv1409.7535OpenAlexW2282582397MaRDI QIDQ267198

Noah Golowich

Publication date: 8 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Brooks' theoremdigraph chromatic numberdigraph coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Digraphs and Variable Degeneracy ⋮ The minimum number of edges in 4-critical digraphs of given order ⋮ Partitioning into degenerate graphs in linear time ⋮ A note on coloring digraphs of large girth

Cites Work

• The size Ramsey number of a directed path
• Two results on the digraph chromatic number
• Coloring digraphs with forbidden cycles
• Strengthened Brooks' theorem for digraphs of girth at least three
• Eigenvalues and colorings of digraphs
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• A bound on the chromatic number of a graph
• Another bound on the chromatic number of a graph
• Digraph Girth via Chromatic Number
• Acyclic systems of representatives and acyclic colorings of digraphs
• The circular chromatic number of a digraph
• On Brooks' Theorem for Sparse Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item