Directed acyclic graphs with the unique dipath property (Q393144): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Good edge-labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic grooming on the path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number, girth and maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the existence of highly chromatic hypergraphs without short cycles / rank
 
Normal rank

Latest revision as of 06:30, 7 July 2024

scientific article
Language Label Description Also known as
English
Directed acyclic graphs with the unique dipath property
scientific article

    Statements

    Directed acyclic graphs with the unique dipath property (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    DAG
    0 references
    directed acyclic graphs
    0 references
    load
    0 references
    wavelengths
    0 references
    dipaths
    0 references
    good labelings
    0 references
    conflict graphs
    0 references
    intersection graphs
    0 references
    chromatic number
    0 references
    0 references