Coloring digraphs with forbidden cycles (Q490994): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tournaments and colouring / 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: Diconnected Orientations and a Conjecture of Las Vergnas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Min-Max Theorem on Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of length 0 modulo 4 in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumference, chromatic number and online coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with \(k\) odd cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's Theorem for List Coloring of Digraphs / 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: Two results on the digraph chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Girth via Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number using the longest odd cycle length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle length parities and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle lengths and chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular colorings of edge-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dichromatic number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems on cycles and colorings / rank
 
Normal rank

Latest revision as of 16:00, 10 July 2024

scientific article
Language Label Description Also known as
English
Coloring digraphs with forbidden cycles
scientific article

    Statements

    Coloring digraphs with forbidden cycles (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    digraph
    0 references
    cycle length
    0 references
    chromatic number
    0 references
    acyclic coloring
    0 references
    dichromatic number
    0 references

    Identifiers

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