Richardson's theorem in \(H\)-coloured digraphs (Q292262): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6592582 / rank
 
Normal rank
Property / zbMATH Keywords
 
kernel
Property / zbMATH Keywords: kernel / rank
 
Normal rank
Property / zbMATH Keywords
 
kernel by monochromatic paths
Property / zbMATH Keywords: kernel by monochromatic paths / rank
 
Normal rank
Property / zbMATH Keywords
 
color-class digraph
Property / zbMATH Keywords: color-class digraph / rank
 
Normal rank
Property / zbMATH Keywords
 
\(H\)-coloured digraph
Property / zbMATH Keywords: \(H\)-coloured digraph / rank
 
Normal rank
Property / zbMATH Keywords
 
\(H\)-kernel
Property / zbMATH Keywords: \(H\)-kernel / rank
 
Normal rank

Revision as of 21:03, 27 June 2023

scientific article
Language Label Description Also known as
English
Richardson's theorem in \(H\)-coloured digraphs
scientific article

    Statements

    Richardson's theorem in \(H\)-coloured digraphs (English)
    0 references
    13 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    kernel
    0 references
    kernel by monochromatic paths
    0 references
    color-class digraph
    0 references
    \(H\)-coloured digraph
    0 references
    \(H\)-kernel
    0 references