The complexity of arc-colorings for directed hypergraphs
From MaRDI portal
Publication:5899364
DOI10.1016/j.endm.2004.03.056zbMath1125.05308OpenAlexW2031027508MaRDI QIDQ5899364
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.lix.polytechnique.fr/~liberti/ctw04/
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
On vertex independence number of uniform hypergraphs ⋮ The complexity of arc-colorings for directed hypergraphs
Cites Work
- Directed hypergraphs and applications
- Minimal Representation of Directed Hypergraphs
- The NP-Completeness of Edge-Coloring
- Using euler partitions to edge color bipartite multigraphs
- Cayley Digraphs Based on the de Bruijn Networks
- The complexity of arc-colorings for directed hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item