Approximate graph products

DOI10.1016/j.ejc.2008.09.006zbMath1210.05125OpenAlexW2112164062WikidataQ56990862 ScholiaQ56990862MaRDI QIDQ1024311

Wilfried Imrich, Marc Hellmuth, Werner Klöckl, Peter F. Stadler

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.006

Mathematics Subject Classification ID

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

Related Items (6)

Unique square property, equitable partitions, and product-like graphs ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ Fibonacci \((p,r)\)-cubes as Cartesian products ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs ⋮ A local prime factor decomposition algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the prime factors of strong direct product graphs in polynomial time
• Graph multiplication
• Recognizing Cartesian products in linear time
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Quasi-independence, homology and the unity of type: a topological theory of characters
• On Factorable Extensions and Subgraphs of Prime Graphs
• Cardinal multiplication of structures with a reflexive relation

This page was built for publication: Approximate graph products