Pages that link to "Item:Q1210332"
From MaRDI portal
The following pages link to Cartesian graph factorization at logarithmic cost per edge (Q1210332):
Displaying 24 items.
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Recognizing some complementary products (Q389934) (← links)
- On isomorphism between circulant and Cartesian product of 2 cycles (Q494437) (← links)
- Recognizing triangulated Cartesian graph products (Q658038) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- On the Hadwiger's conjecture for graph products (Q864168) (← links)
- Fast factorization of Cartesian products of (directed) hypergraphs (Q906379) (← links)
- Hadwiger number and the Cartesian product of graphs (Q1014821) (← links)
- Strong products of Kneser graphs (Q1336712) (← links)
- Recognizing Cartesian graph bundles (Q1356477) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- Algorithm for recognizing Cartesian graph bundles (Q1613382) (← links)
- Strong products of \(\chi\)-critical graphs (Q1801332) (← links)
- On the weak reconstruction of Cartesian-product graphs (Q1916107) (← links)
- Lattice fermions as spectral graphs (Q2087256) (← links)
- Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs (Q2254071) (← links)
- Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
- Isomorphism between circulants and Cartesian products of cycles (Q2357772) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- (Q4223059) (← links)
- On Cartesian products of signed graphs (Q5896107) (← links)
- Recognizing graph products and bundles (Q6560201) (← links)
