The \(m\)-degenerate chromatic number of a digraph (Q267198): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6566508 / rank
 
Normal rank
Property / zbMATH Keywords
 
digraph coloring
Property / zbMATH Keywords: digraph coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
digraph chromatic number
Property / zbMATH Keywords: digraph chromatic number / rank
 
Normal rank
Property / zbMATH Keywords
 
Brooks' theorem
Property / zbMATH Keywords: Brooks' theorem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2282582397 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.7535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic systems of representatives and acyclic colorings of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number of a directed path / rank
 
Normal rank
Property / cites work
 
Property / cites work: The circular chromatic number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another bound on the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring digraphs with forbidden cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Brooks' Theorem for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two results on the digraph chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened Brooks' theorem for digraphs of girth at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Girth via Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and colorings of digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:58, 11 July 2024

scientific article
Language Label Description Also known as
English
The \(m\)-degenerate chromatic number of a digraph
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references