Recognizing graph products and bundles

DOI10.1007/BFB0037431zbMATH Open1541.68302MaRDI QIDQ6560201FDOQ6560201

Authors: Janez Žerovnik 

Publication date: 21 June 2024

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

Mathematics Subject Classification ID

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

Cites Work

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

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)