The following pages link to The Categorical Product of Graphs (Q5554154):
Displayed 41 items.
- Super connectivity of Kronecker product of complete bipartite graphs and complete graphs (Q279219) (← links)
- Some remarks on the Kronecker product of graphs (Q293407) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles (Q433407) (← links)
- On the super connectivity of Kronecker products of graphs (Q436343) (← links)
- Resolvability and strong resolvability in the direct product of graphs (Q511842) (← links)
- Interleaved adjoints of directed graphs (Q648963) (← links)
- On bandwidth for the tensor product of paths and cycles (Q678881) (← links)
- Finding the prime factors of strong direct product graphs in polynomial time (Q686286) (← links)
- Multiple Kronecker covering graphs (Q925013) (← links)
- Distance-residual subgraphs (Q973137) (← links)
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh (Q1014414) (← links)
- On multiplicative graphs and the product conjecture (Q1110530) (← links)
- Associative products of graphs (Q1226506) (← links)
- Fractional multiples of graphs and the density of vertex-transitive graphs (Q1296389) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- The complexity of colouring symmetric relational systems (Q1327221) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Multiplicativity of acyclic digraphs (Q1377696) (← links)
- A worthy family of semisymmetric graphs (Q1408884) (← links)
- Factoring cardinal product graphs in polynomial time (Q1584444) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Families of regular graphs in regular maps (Q1850613) (← links)
- Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (Q1913439) (← links)
- Lattices arising in categorial investigations of Hedetniemi's conjecture (Q1917488) (← links)
- Coloring graph products---a survey (Q1923489) (← links)
- Chromatic difference sequences and homomorphisms (Q2366032) (← links)
- The irregularity of graphs under graph operations (Q2450125) (← links)
- Über das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems) (Q2550037) (← links)
- On Some Graph Operations and Related Applications (Q2839255) (← links)
- On the chromatic number of the product of graphs (Q3815317) (← links)
- Combinatorial properties of products of graphs (Q3982189) (← links)
- Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs (Q3984459) (← links)
- Star chromatic numbers and products of graphs (Q4016022) (← links)
- An approach to hedetniemi's conjecture (Q4020700) (← links)
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs (Q4248532) (← links)
- Representations of graphs modulo <i>n</i> (Q4317222) (← links)
- The super edge connectivity of Kronecker product graphs (Q4553888) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- The Kronecker product and local computations in graphs (Q5878897) (← links)
- Independence numbers of product graphs (Q5906581) (← links)