Paths with two blocks in \(k\)-chromatic digraphs (Q1886358): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3900086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions and line digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950574 / 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: Paths and Cycles in Tournaments / rank
 
Normal rank

Latest revision as of 15:20, 7 June 2024

scientific article
Language Label Description Also known as
English
Paths with two blocks in \(k\)-chromatic digraphs
scientific article

    Statements

    Paths with two blocks in \(k\)-chromatic digraphs (English)
    0 references
    18 November 2004
    0 references
    Digraph
    0 references
    Paths
    0 references
    Coloring
    0 references
    0 references

    Identifiers