algorithmscanonical representationscartesian prime factorizationisometric representationproduct graph representation
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cites work
Cited in
(35)- Approximate graph products
- Canonical representations of partial 2- and 3-trees
- A new fixed point approach for stable networks and stable marriages
- Cartesian graph factorization at logarithmic cost per edge
- Recognizing median graphs in subquadratic time
- Convexity in finite metric spaces
- On the natural imprint function of a graph
- Recognizing Cartesian graph bundles
- Quasi-median graphs, their generalizations, and tree-like equalities
- Factoring cardinal product graphs in polynomial time
- Algorithm for recognizing Cartesian graph bundles
- Recognizing halved cubes in a constant time per edge
- Structure of Fibonacci cubes: a survey
- The algebra of metric betweenness. I: Subdirect representation and retraction
- On finding convex cuts in general, bipartite and plane graphs
- Fibonacci \((p,r)\)-cubes as Cartesian products
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
- Isometric Hamming embeddings of weighted graphs
- On recognition of strong graph bundles
- Product vague graphs and its applications
- Recognizing some complementary products
- Unique square property, equitable partitions, and product-like graphs
- Factoring cartesian‐product graphs
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs
- Factorization and pseudofactorization of weighted graphs
- Robust Factorizations and Colorings of Tensor Graphs
- Recognizing graph products and bundles
- The complement of the Djoković-Winkler relation
- Computing equivalence classes among the edges of a graph with applications
- Finding the prime factors of strong direct product graphs in polynomial time
- A note on Winkler's algorithm for factoring a connected graph
- Recognizing Cartesian products in linear time
- Partial cubes and their \(\tau\)-graphs
- Fast factorization of Cartesian products of (directed) hypergraphs
This page was built for publication: Product graph representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020705)
