Recognizing graph products and bundles
From MaRDI portal
Publication:6560201
DOI10.1007/bfb0037431zbMATH Open1541.68302MaRDI QIDQ6560201
Publication date: 21 June 2024
Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Factoring a graph in polynomial time
- Finding the prime factors of strong direct product graphs in polynomial time
- Graph multiplication
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Cartesian graph factorization at logarithmic cost per edge
- Associative products of graphs
- Faster isometric embedding in products of complete graphs
- Recognizing Cartesian graph bundles
- Edge-colorability of graph bundles
- On the weak reconstruction of Cartesian-product graphs
- On Isometric Embeddings of Graphs
- Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
- Product graph representations
- Factoring cartesian‐product graphs
- On Factorable Extensions and Subgraphs of Prime Graphs
- Operations with structures
This page was built for publication: Recognizing graph products and bundles
