Bounded degree acyclic decompositions of digraphs. (Q1426101): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Balanced vertex-orderings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-efficient static and incremental graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear arboricity of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal three-dimensional orthogonal graph drawing in the general position model. / rank
 
Normal rank

Revision as of 14:47, 6 June 2024

scientific article
Language Label Description Also known as
English
Bounded degree acyclic decompositions of digraphs.
scientific article

    Statements

    Bounded degree acyclic decompositions of digraphs. (English)
    0 references
    0 references
    14 March 2004
    0 references
    Digraph
    0 references
    Acyclic subgraph
    0 references
    Acyclic decomposition
    0 references
    Arboricity
    0 references
    Diarboricity
    0 references

    Identifiers