A survey on hypergraph products

DOI10.1007/s11786-012-0109-6zbMath1262.05110arXiv1705.06037OpenAlexW2031454823WikidataQ56990529 ScholiaQ56990529MaRDI QIDQ1948609

Peter F. Stadler, Marc Hellmuth, Lydia Ostermeier

Publication date: 24 April 2013

Published in: Mathematics in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

productsset systemshypergraph invariants

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Associativity and non-associativity of some hypergraph products ⋮ Homotopy and Hom construction in the category of finite hypergraphs ⋮ Fast factorization of Cartesian products of (directed) hypergraphs ⋮ A survey on hypergraph products ⋮ Applying a hypergraph to determine the structure of some finite modules ⋮ Unnamed Item ⋮ Strong products of hypergraphs: unique prime factorization theorems and algorithms ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ Unnamed Item ⋮ Homology of path complexes and hypergraphs ⋮ The grid property and product-like hypergraphs

Uses Software

• TopoLayout

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local prime factor decomposition algorithm
• Graph multiplication
• Clique graphs and Helly graphs
• On the chromatic number and independence number of hypergraph products
• Recognizing Cartesian products in linear time
• On direct product cancellation of graphs
• The automorphism group of the wreath product of directed graphs
• Associative products of graphs
• Discrepancy of cartesian products of arithmetic progressions
• Matchings and covers in hypergraphs
• A survey on hypergraph products
• Über das schwache Kartesische Produkt von Graphen
• Über das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems)
• The Cartesian product of hypergraphs
• A note on quasi-robust cycle bases
• Factorization of Cartesian Products of Hypergraphs
• On Tensor Powers of Integer Programs
• On Partitioning and Packing Products with Rectangles
• An efficient graph‐theoretical force method for three‐dimensional finite element analysis
• A prime factor theorem for a generalized direct product
• Lexicographic Products and the Power of Non-linear Network Coding
• Hide and Seek, Data Storage, and Entropy
• An efficient method for decomposition of regular structures using graph products