The following pages link to Product graph representations (Q4020705):
Displaying 33 items.
- Recognizing some complementary products (Q389934) (← links)
- Unique square property, equitable partitions, and product-like graphs (Q394372) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- A note on Winkler's algorithm for factoring a connected graph (Q686292) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- Partial cubes and their \(\tau\)-graphs (Q875040) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- Recognizing median graphs in subquadratic time (Q1285576) (← links)
- Convexity in finite metric spaces (Q1337115) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- Recognizing halved cubes in a constant time per edge (Q1902967) (← links)
- Structure of Fibonacci cubes: a survey (Q1956242) (← links)
- The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
- On finding convex cuts in general, bipartite and plane graphs (Q2402674) (← links)
- Fibonacci \((p,r)\)-cubes as Cartesian products (Q2449173) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs (Q2573719) (← links)
- Isometric Hamming embeddings of weighted graphs (Q2696622) (← links)
- (Q2777507) (← links)
- Factoring cartesian‐product graphs (Q4309984) (← links)
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs (Q4847142) (← links)
- On Cartesian products of signed graphs (Q5896107) (← links)
- Factorization and pseudofactorization of weighted graphs (Q6162029) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Recognizing graph products and bundles (Q6560201) (← links)
- The complement of the Djoković-Winkler relation (Q6658058) (← links)
