Recognizing graph products and bundles

DOI10.1007/BFB0037431MaRDI QIDQ6560201zbMATHFDO

Authors Janez Žerovnik

Publication date 21 June 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On recognition of strong graph bundles
• Recognizing Cartesian graph bundles
• scientific article; zbMATH DE number 1550912
• On recognizing Cartesian graph bundles
• Algorithm for recognizing Cartesian graph bundles

Cites work

• scientific article; zbMATH DE number 91031 (Why is no real title available?)
• scientific article; zbMATH DE number 653263 (Why is no real title available?)
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Associative products of graphs
• Cartesian graph factorization at logarithmic cost per edge
• Edge-colorability of graph bundles
• Factoring a graph in polynomial time
• Factoring cartesian‐product graphs
• Faster isometric embedding in products of complete graphs
• Finding the prime factors of strong direct product graphs in polynomial time
• Graph multiplication
• On Factorable Extensions and Subgraphs of Prime Graphs
• On Isometric Embeddings of Graphs
• On the weak reconstruction of Cartesian-product graphs
• Operations with structures
• Product graph representations
• Recognizing Cartesian graph bundles
• Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism

This page was built for publication: Recognizing graph products and bundles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560201)