The grid property and product-like hypergraphs
From MaRDI portal
Publication:2345539
DOI10.1007/s00373-013-1392-yzbMath1312.05100OpenAlexW2008909390WikidataQ56267598 ScholiaQ56267598MaRDI QIDQ2345539
Lydia Ostermeier, Peter F. Stadler
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1392-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unique square property, equitable partitions, and product-like graphs
- Graph multiplication
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Unique square property and fundamental factorizations of graph bundles
- Recognizing Cartesian graph bundles
- Algorithm for recognizing Cartesian graph bundles
- Edge-colorability of graph bundles
- A survey on hypergraph products
- The Cartesian product of hypergraphs
- Factoring cartesian‐product graphs
This page was built for publication: The grid property and product-like hypergraphs