Characterization of color patterns by dynamic \(H\)-paths (Q2322868): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reachability problems in edge-colored digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monochromatic paths and monochromatic cycles in edge coloured tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On panchromatic patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absorbing sets in arc-coloured tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitions with prescribed patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monochromatic paths in m-coloured tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monochromatic paths in edge-coloured digraphs / rank
 
Normal rank

Latest revision as of 09:53, 20 July 2024

scientific article
Language Label Description Also known as
English
Characterization of color patterns by dynamic \(H\)-paths
scientific article

    Statements

    Characterization of color patterns by dynamic \(H\)-paths (English)
    0 references
    5 September 2019
    0 references
    0 references
    edge colored digraph
    0 references
    kernels in digraphs
    0 references
    dynamic \(H\)-kernel
    0 references
    dynamic \(H\)-walks
    0 references
    0 references