Independence and Matchings in $\sigma$-hypergraphs

zbMath1325.05115arXiv1405.0107MaRDI QIDQ3451436

Josef Lauri, Christina Zarb, Yair Caro

Publication date: 16 November 2015

Full work available at URL: https://arxiv.org/abs/1405.0107

zbMATH Keywords

constrained colouring

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Emergence and dynamics of short food supply chains

This page was built for publication: Independence and Matchings in $\sigma$-hypergraphs