The Cartesian product of hypergraphs

DOI10.1002/jgt.20609zbMath1242.05193OpenAlexW1880814952WikidataQ56990618 ScholiaQ56990618MaRDI QIDQ2888888

Peter F. Stadler, Marc Hellmuth, Lydia Ostermeier

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20609

zbMATH Keywords

hypergraphweak Cartesian productprime factor decompositiondirected hypergraphgrid-property

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

Associativity and non-associativity of some hypergraph products ⋮ Fast factorization of Cartesian products of (directed) hypergraphs ⋮ A survey on hypergraph products ⋮ Gutman index and detour Gutman index of pseudo-regular graphs ⋮ The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs ⋮ The grid property and product-like hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A category-theoretical approach to hypergraphs
• Graph multiplication
• On the chromatic number and independence number of hypergraph products
• Directed hypergraphs and applications
• Über das schwache Kartesische Produkt von Graphen
• On Tensor Powers of Integer Programs
• Factoring cartesian‐product graphs
• A prime factor theorem for a generalized direct product
• Weak cartesian product of graphs

This page was built for publication: The Cartesian product of hypergraphs