The complexity of arc-colorings for directed hypergraphs (Q5917590): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley Digraphs Based on the de Bruijn Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using euler partitions to edge color bipartite multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492575 / rank
 
Normal rank

Latest revision as of 16:21, 7 June 2024

scientific article; zbMATH DE number 2118343
Language Label Description Also known as
English
The complexity of arc-colorings for directed hypergraphs
scientific article; zbMATH DE number 2118343

    Statements

    The complexity of arc-colorings for directed hypergraphs (English)
    0 references
    0 references
    23 November 2004
    0 references
    Arc-coloring
    0 references
    Brick-coloring
    0 references
    Complexity
    0 references
    Directed hypergraph
    0 references
    Wall
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references