✦ LIBER ✦

The complexity of arc-colorings for directed hypergraphs

✍ Scribed by Andrea Vietri

Book ID: 108112473
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 204 KB
Volume: 143
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial extremum problems for 2-co

Combinatorial extremum problems for 2-colorings of hypergraphs

✍ A. P. Rozovskaya 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 608 KB

Parameterized Complexity of Arc-Weighted

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

✍ Guo, Jiong; Niedermeier, Rolf; Suchý, Ondřej 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 280 KB

The coloring complex and cyclic coloring

The coloring complex and cyclic coloring complex of a complete k-uniform hypergraph

✍ Sarah Crown Rundell 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 231 KB

On the Complexity of Ordered Colorings

✍ Gupta, Arvind; van den Heuvel, Jan; Maňuch, Ján; Stacho, Ladislav; Zhao, Xiaohon 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

The Hodge structure of the coloring comp

The Hodge structure of the coloring complex of a hypergraph

✍ Jane Holsapple Long; Sarah Crown Rundell 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 251 KB

The complexity of generalized graph colo

The complexity of generalized graph colorings

✍ Jason I. Brown 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1004 KB