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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031027508 / rank
 
Normal rank
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: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / 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: 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
Property / cites work
 
Property / cites work: The complexity of arc-colorings for directed hypergraphs / rank
 
Normal rank

Latest revision as of 20:06, 25 June 2024

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

    Statements