The complexity of arc-colorings for directed hypergraphs
From MaRDI portal
Publication:5917590
DOI10.1016/j.dam.2004.04.002zbMath1058.05027MaRDI QIDQ5917590
Publication date: 23 November 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.04.002
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
α-Derivable digraphs and its application in wireless sensor networking, Flow hypergraph reducibility, Flow Hypergraph Reducibility
Cites Work
- On the orientation of graphs and hypergraphs
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item